Exit Zen
21
../../protocols/tls.rst:47
English
FTP
0/100 · 3
21
../../protocols/transport-service.rst:60
English
`0:0:0:0:0:0:0:1` is represented as `::1`
0/410 · 41
21
../../protocols/udp.rst:71
English
The checksum of the UDP segment is computed over :
0/500 · 50
21
../../protocols/wifi.rst:24
English
802.11b
0/100 · 7
22
../../bibliography.rst:68
English
Sally Floyd and Van Jacobson. 1993. `Random early detection gateways for congestion avoidance <https://dx.doi.org/10.1109/90.251892>`_. IEEE/ACM Transactions Networking 1, 4 (August 1993), 397-413.
0/1970 · 197
22
../../glossary.rst:235
English
BNF
0/100 · 3
22
../../exercises/ex-sharing.rst:538 • ../../exercises/ex-sharing.rst:613
English
Consider the network depicted in the figure below.
0/500 · 50
22
../../principles/security.rst:287
English
With the Kerckhoff principle, we can now discuss a simple but powerful encryption scheme that relies on the `XOR` logic operation. This operation is easily implemented in hardware and is supported by all microprocessors. Given a secret, :math:`K`, it is possible to encode a message `M` by computing :math:`C_M = K \oplus M`. The receiver of this messages can recover the original message as since :math:`M = K \oplus (K \oplus M)`. This `XOR` operation is the key operation of the perfect cipher that is also called the Vernam cipher or the one-time pad. This cipher relies on a key that contains purely random bits. The encrypted message is then produced by XORing all the bits of the message with all the bits of the key. Since the key is random, it is impossible for an attacker to recover the original text (or plain text) from the encrypted one. From a security viewpoint, the one-time-pad is the best solution provided that the key is as long as the message.
0/9650 · 965
22
../../exercises/dns.rst:59
English
Use `dig` to find the mail relays used by the `uclouvain.be` and `student.uclouvain.be` domains. What is the `TTL` of these records ? Can you explain the preferences used by the `MX` records. You can find more information about the MX records in :rfc:`5321`.
0/2580 · 258
22
../../exercises/ipv6.rst:193
English
How do you configure the forwarding tables on ``R1`` and ``R4`` so that ``A`` can reach ``B`` and the reverse ?
0/1110 · 111
22
../../exercises/lan.rst:246
English
The first part of the output of the :manpage:`brctl(8)` command shows the state of the Spanning Tree software on the switch. The identifier of this switch is ``0003.f63545ab5f79`` and the root switch is itself. There is no root port on this switch since it is the root. The path cost is the cost of the path to reach the root switch, i.e. 0 on the root. Then the switch reports the different timers.
0/3990 · 399
22
../../exercises/routing-policies.rst:193
English
`Section 3.3 <https://tools.ietf.org/html/rfc4443#section-3.3>`_ of :rfc:`4443` explains two different reasons why an IPv6 enabled device could generate an ICMPv6 Time Exceeded message. Explain when a router could generate such a message with ``Code==0`` and when a host could generate such a message with ``Code==1``.
0/3180 · 318
22
../../exercises/routing-protocols.rst:269
English
A more detailed discussion of the packets that routing protocols exchange may be found in [Goralski2009]_.
0/1060 · 106
22
../../exercises/tcp-2.rst:123
English
In the example above, packetdrill_ injects a segment containing two bytes. This segment is acknowledged and after that the :manpage:`read` system call succeeds and reads the available data with a buffer of 1000 bytes. It returns the amount of read bytes, i.e. ``2``.
0/2660 · 266
22
../../exercises/trace.rst:112
English
a nice `list of Wireshark Display Filters <https://networksecuritytools.com/list-wireshark-display-filters/>`_ by Robert Allen
0/1260 · 126
22
../../protocols/bgp.rst:76
English
These different types of relationships are implemented in the `interdomain routing policies` defined by each domain. The `interdomain routing policy` of a domain is composed of three main parts :
0/1950 · 195
22
../../protocols/congestion.rst:115
English
The TCP flags
0/130 · 13
22
../../protocols/dnssec.rst:215
English
Thanks to the `DS` record, a resolver can validate the public keys of client zones as long as their is a chain of `DS` -> `DNSKEY` records from an anchored key. If the resolver trusts the public key of the root zone, it can validate all DNS replies for which this chain exists.
0/2770 · 277
22
../../protocols/email.rst:122
English
Note the empty line after the `Date:` header line; this empty line contains only the `CR` and `LF` characters, and marks the boundary between the header and the body of the message.
0/1810 · 181
22
../../protocols/ethernet.rst:149
English
Computers can directly be attached to Ethernet hubs. Ethernet hubs themselves can be attached to other Ethernet hubs to build a larger network. However, some important guidelines must be followed when building a complex network with hubs. First, the network topology must be a tree. As hubs are relays in the physical layer, adding a link between `Hub2` and `Hub3` in the network below would create an electrical shortcut that would completely disrupt the network. This implies that there cannot be any redundancy in a hub-based network. A failure of a hub or of a link between two hubs would partition the network into two isolated networks. Second, as hubs are relays in the physical layer, collisions can happen and must be handled by CSMA/CD as in a 10Base5 network. This implies that the maximum delay between any pair of devices in the network cannot be longer than the 51.2 microseconds `slot time`. If the delay is longer, collisions between short frames may not be correctly detected. This constraint limits the geographical spread of 10BaseT networks containing hubs.
0/10770 · 1077