mirre-mt/masters-thesis
Archived
1
0
Fork 0
Code Releases 1 Activity

tex: crypto changes

Browse Source
This commit is contained in:
leo 2023-05-25 02:21:05 +02:00
parent 7bc8979320
commit cd7b4a1bf5
Signed by: wanderer
SSH Key Fingerprint: SHA256:Dp8+iwKHSlrMEHzE3bJnPng70I7LEsa3IJXRH/U+idQ
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
tex/text.tex
View File

@ -101,7 +101,7 @@ distributed to the other party via untrusted channels. In 1976 Whitfield Diffie
and Martin Hellman published a paper in which they devised a \emph{public-key and Martin Hellman published a paper in which they devised a \emph{public-key
distribution scheme}, which allows the two parties to arrive at a shared secret distribution scheme}, which allows the two parties to arrive at a shared secret
by exchanging information via insecure channels with the presence of an by exchanging information via insecure channels with the presence of an
eavesdropper. eavesdropper. This scheme (or its variations) is in use to this day.
\n{2}{Hash functions} \n{2}{Hash functions}
@ -117,11 +117,12 @@ device has come across, such as when connecting to a website protected by the
famed HTTPS. famed HTTPS.
The popularity stems from a common use case: the need to identify a chunk of The popularity stems from a common use case: the need to identify a chunk of
data. Of course, two chunks of data, two files, frames or packets could data. Of course, two chunks of data, two files, frames or packets could always
always be compared bit by bit, but that can get prohibitive from both cost and be compared bit by bit, but that can get prohibitive from both cost and energy
energy point of view relatively quickly. That is when hash functions come in, point of view relatively quickly. That is when the hash functions come in,
since they are able to take a long input and produce a short output, named a since they are able to take a long input and produce a short output, named a
digest or a hash value. digest or a hash value. It also does not work the other way around, a file
cannot be reconstructed from the hash digest, it is a one-way function.
\n{3}{Rainbow tables} \n{3}{Rainbow tables}