-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCryptography.out
41 lines (41 loc) · 3 KB
/
Cryptography.out
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
\BOOKMARK [0][-]{chapter.1}{Historical ciphers and general principles}{}% 1
\BOOKMARK [1][-]{section.1.1}{Cryptography}{chapter.1}% 2
\BOOKMARK [2][-]{subsection.1.1.1}{Confidentiality}{section.1.1}% 3
\BOOKMARK [2][-]{subsection.1.1.2}{Authentication}{section.1.1}% 4
\BOOKMARK [1][-]{section.1.2}{Cryptanalysis}{chapter.1}% 5
\BOOKMARK [2][-]{subsection.1.2.1}{Mathematical cryptanalysis}{section.1.2}% 6
\BOOKMARK [2][-]{subsection.1.2.2}{Key length}{section.1.2}% 7
\BOOKMARK [2][-]{subsection.1.2.3}{Time to break}{section.1.2}% 8
\BOOKMARK [1][-]{section.1.3}{Some ciphers}{chapter.1}% 9
\BOOKMARK [2][-]{subsection.1.3.1}{Shift encryption scheme}{section.1.3}% 10
\BOOKMARK [2][-]{subsection.1.3.2}{Mono-alphabetic substitution}{section.1.3}% 11
\BOOKMARK [2][-]{subsection.1.3.3}{Poly-alphabetic substitution}{section.1.3}% 12
\BOOKMARK [2][-]{subsection.1.3.4}{Vigen\350re cipher}{section.1.3}% 13
\BOOKMARK [1][-]{section.1.4}{Perfect secrecy \(PS \205 unconditional security\)}{chapter.1}% 14
\BOOKMARK [2][-]{subsection.1.4.1}{Perfect secrecy and length of keys}{section.1.4}% 15
\BOOKMARK [2][-]{subsection.1.4.2}{One-time pad \(OTP\)}{section.1.4}% 16
\BOOKMARK [1][-]{section.1.5}{Computational security}{chapter.1}% 17
\BOOKMARK [1][-]{section.1.6}{Security principles}{chapter.1}% 18
\BOOKMARK [2][-]{subsection.1.6.1}{Goals of an adversary}{section.1.6}% 19
\BOOKMARK [2][-]{subsection.1.6.2}{Ability to query the scheme}{section.1.6}% 20
\BOOKMARK [2][-]{subsection.1.6.3}{Taxonomy of attacks}{section.1.6}% 21
\BOOKMARK [2][-]{subsection.1.6.4}{Formal definition of an encryption scheme}{section.1.6}% 22
\BOOKMARK [2][-]{subsection.1.6.5}{Semantic security}{section.1.6}% 23
\BOOKMARK [2][-]{subsection.1.6.6}{INDististinguishability games}{section.1.6}% 24
\BOOKMARK [2][-]{subsection.1.6.7}{Extending security strength definition}{section.1.6}% 25
\BOOKMARK [2][-]{subsection.1.6.8}{INDististinguishability using a diversifier \(nonce\)}{section.1.6}% 26
\BOOKMARK [1][-]{section.1.7}{Authentication schemes}{chapter.1}% 27
\BOOKMARK [2][-]{subsection.1.7.1}{Types of forgeries}{section.1.7}% 28
\BOOKMARK [2][-]{subsection.1.7.2}{Taxonomy of authentication scheme attacks}{section.1.7}% 29
\BOOKMARK [2][-]{subsection.1.7.3}{Formal definition of an authentication scheme}{section.1.7}% 30
\BOOKMARK [2][-]{subsection.1.7.4}{Some games for unforgeability : EU-CMA}{section.1.7}% 31
\BOOKMARK [0][-]{chapter.2}{Secret-key techniques}{}% 32
\BOOKMARK [1][-]{section.2.1}{Basic schema}{chapter.2}% 33
\BOOKMARK [1][-]{section.2.2}{Stream ciphers vs block ciphers}{chapter.2}% 34
\BOOKMARK [1][-]{section.2.3}{Keystream generators and stream ciphers}{chapter.2}% 35
\BOOKMARK [1][-]{section.2.4}{Block ciphers}{chapter.2}% 36
\BOOKMARK [2][-]{subsection.2.4.1}{DES}{section.2.4}% 37
\BOOKMARK [2][-]{subsection.2.4.2}{Rijndael and AES}{section.2.4}% 38
\BOOKMARK [2][-]{subsection.2.4.3}{Modes of operation}{section.2.4}% 39
\BOOKMARK [1][-]{section.2.5}{Permutations}{chapter.2}% 40
\BOOKMARK [1][-]{section.2.6}{Pseudo-random functions}{chapter.2}% 41