Exit Zen
17
../../protocols/ssh.rst:140
English
the server generates the random number :math:`b`. It then computes :math:`B=g^{b} \mod p`, :math:`K=B^{a} \mod p` and signs with its private key :math:`hash(V_{Client} || V_{Server} || KEX\_INIT_{Client} || KEX\_INIT_{Server} || Server_{pub} || A || B || K )` where :math:`V_{Server}` (resp. :math:`V_{Client}`) is the initial messages sent by the client (resp. server), :math:`KEX\_INIT_{Client}` (resp. :math:`KEX\_INIT_{Server}`) is the key exchange message sent by the client (resp. server) and :math:`A`, :math:`B` and :math:`K` are the messages of the Diffie Hellman key exchange
0/5860 · 586
17
../../protocols/tcp.rst:42
English
the port chosen by the server
0/290 · 29
17
../../protocols/tls.rst:45
English
563
0/100 · 3
17
../../protocols/transport-service.rst:53
English
`fe80:0:0:0:219:e3ff:fed7:1204`
0/310 · 31
17
../../protocols/udp.rst:61
English
the ephemeral port numbers ( officially [#fephemeral]_ 49152 <= port <= 65535 )
0/790 · 79
17
../../protocols/wifi.rst:23
English
5 GHz
0/100 · 5
18
../../bibliography.rst:63
English
Dijkstra, E., `A Note on Two Problems in Connection with Graphs <https://dx.doi.org/10.1007/BF01386390>`_. Numerische Mathematik, 1:269- 271, 1959
0/1460 · 146
18
../../glossary.rst:226
English
ATM
0/100 · 3
18
../../exercises/ex-sharing.rst:382
English
To understand congestion control algorithms, it can also be useful to represent the exchange of packets by using a graphical representation. As a first example, let us consider a very simple network composed of two hosts interconnected through a switch.
0/2530 · 253
18
../../principles/transport.rst:45
English
Bob : `This is the correct password, you're welcome`
0/520 · 52
18
../../principles/security.rst:247
English
Cryptography techniques have initially been defined and used by spies and armies to exchange secret information in manner that ensures that adversaries cannot decode the information even if they capture the message or the person carrying the message. A wide range of techniques have been defined. The first techniques relied on their secrecy to operate. One of the first encryption schemes is attributed to Julius Caesar. When he sent confidential information to his generals, he would encode each message by replacing each letter with another letter that is :math:`n` positions after this letter in the alphabet. For example, the message `SECRET` becomes `VHFUHW` when encoded using Caesar's cipher. This technique could have puzzled some soldiers during Caesar's wars, but today even young kids can recover the original message from the ciphered one.
0/8520 · 852
18
../../exercises/dns.rst:53
English
Use `dig` to send a query to one of these DNS servers to find the IP address of the DNS server(s) (NS record) responsible for `root-servers.org`
0/1440 · 144
18
../../exercises/http.rst:55
English
The list of available language tags can be found at http://www.iana.org/assignments/language-subtag-registry. Versions in other formats are available at http://www.langtag.net/registries.html. Additional information about the support of multiple languages in Internet protocols may be found in rfc5646_.
0/3030 · 303
18
../../exercises/ipv6.rst:139
English
In this network, select `all` the rules in the shown forwarding tables that ensure that the packets sent from ``A`` to ``B`` follow the reverse path of the packets sent by ``B`` to ``A``.
0/1870 · 187
18
../../exercises/lan.rst:140
English
This network can be launched with the IPMininet_ script shown below. The entire script is available from :download:`/exercises/ipmininet_scripts/stp.py`.
0/1530 · 153
18
../../exercises/routing-policies.rst:163
English
A simple network
0/160 · 16
18
../../exercises/routing-protocols.rst:253
English
This packet is updated when new information is added in the router's OSPFv3 database. A few seconds router, this router sends another Database description packet that announces more information.
0/1940 · 194
18
../../exercises/tcp-2.rst:98
English
The third segment of the three-way handshake is sent by packetdrill_ after a delay of 0.1 seconds. The connection is now established and the accept system call will succeed.
0/1730 · 173
18
../../exercises/trace.rst:104
English
Wireshark : flow graph
0/220 · 22
18
../../protocols/bgp.rst:62
English
Coming back to the figure above, `AS4` advertises to its two providers `AS1` and `AS2` its own prefixes and the routes learned from its customer, `AS7`. On the other hand, `AS4` advertises to `AS7` all the routes that it knows.
0/2270 · 227