127 lines
9.6 KiB
Plaintext
127 lines
9.6 KiB
Plaintext
\BOOKMARK [0][-]{chapter.1}{Substitionsverfahren}{}% 1
|
|
\BOOKMARK [1][-]{section.1.1}{Skytale}{chapter.1}% 2
|
|
\BOOKMARK [1][-]{section.1.2}{Monoalphabetische Substitionsverfahren}{chapter.1}% 3
|
|
\BOOKMARK [2][-]{subsection.1.2.1}{Caesar-Verschl\374sselung}{section.1.2}% 4
|
|
\BOOKMARK [2][-]{subsection.1.2.2}{H\344ufigkeitsanalyse}{section.1.2}% 5
|
|
\BOOKMARK [1][-]{section.1.3}{Polyalphabetische Substitutionsverfahren}{chapter.1}% 6
|
|
\BOOKMARK [2][-]{subsection.1.3.1}{Vign\350re-Verfahren}{section.1.3}% 7
|
|
\BOOKMARK [2][-]{subsection.1.3.2}{One-Time-Pad}{section.1.3}% 8
|
|
\BOOKMARK [1][-]{section.1.4}{algebraische Substitionsverfahren}{chapter.1}% 9
|
|
\BOOKMARK [2][-]{subsection.1.4.1}{Hill-Verfahren}{section.1.4}% 10
|
|
\BOOKMARK [0][-]{chapter.2}{Modulare Arithmetik}{}% 11
|
|
\BOOKMARK [1][-]{section.2.1}{Exkurs: Division mit Rest}{chapter.2}% 12
|
|
\BOOKMARK [1][-]{section.2.2}{Der Ring Zn}{chapter.2}% 13
|
|
\BOOKMARK [2][-]{subsection.2.2.1}{Addition und Multiplikation}{section.2.2}% 14
|
|
\BOOKMARK [2][-]{subsection.2.2.2}{Subtraktion}{section.2.2}% 15
|
|
\BOOKMARK [2][-]{subsection.2.2.3}{Teiler, Vielfache}{section.2.2}% 16
|
|
\BOOKMARK [2][-]{subsection.2.2.4}{Kongruenz}{section.2.2}% 17
|
|
\BOOKMARK [2][-]{subsection.2.2.5}{Matrizen}{section.2.2}% 18
|
|
\BOOKMARK [2][-]{subsection.2.2.6}{Kartesisches Produkt von Ringen}{section.2.2}% 19
|
|
\BOOKMARK [2][-]{subsection.2.2.7}{Isomorphie von Ringen}{section.2.2}% 20
|
|
\BOOKMARK [1][-]{section.2.3}{Der erweiterte Euklid'sche Algorithmus}{chapter.2}% 21
|
|
\BOOKMARK [2][-]{subsection.2.3.1}{Euklid'scher Algorithmus}{section.2.3}% 22
|
|
\BOOKMARK [2][-]{subsection.2.3.2}{erweiterter Euklid'scher Algorithmus}{section.2.3}% 23
|
|
\BOOKMARK [1][-]{section.2.4}{Euler'sche -Funktion}{chapter.2}% 24
|
|
\BOOKMARK [2][-]{subsection.2.4.1}{-Funktion und Primzahlen}{section.2.4}% 25
|
|
\BOOKMARK [0][-]{chapter.3}{IT-Sicherheit: Gef\344hrdungen und Ma\337nahmen}{}% 26
|
|
\BOOKMARK [1][-]{section.3.1}{Vertraulichkeit}{chapter.3}% 27
|
|
\BOOKMARK [2][-]{subsection.3.1.1}{Schutzma\337nahmen: Verschl\374sselungsverfahren}{section.3.1}% 28
|
|
\BOOKMARK [1][-]{section.3.2}{Integrit\344t}{chapter.3}% 29
|
|
\BOOKMARK [2][-]{subsection.3.2.1}{Schutzma\337nahme: Hashfunktionen, Whitelists}{section.3.2}% 30
|
|
\BOOKMARK [1][-]{section.3.3}{Authenzit\344t der Daten}{chapter.3}% 31
|
|
\BOOKMARK [2][-]{subsection.3.3.1}{Schutzma\337nahme: Signaturen}{section.3.3}% 32
|
|
\BOOKMARK [2][-]{subsection.3.3.2}{Schutz vor Replay-Angriffen}{section.3.3}% 33
|
|
\BOOKMARK [1][-]{section.3.4}{Authenzit\344t von Nutzern}{chapter.3}% 34
|
|
\BOOKMARK [2][-]{subsection.3.4.1}{Schutzma\337nahmen}{section.3.4}% 35
|
|
\BOOKMARK [1][-]{section.3.5}{Zugriffskontrolle}{chapter.3}% 36
|
|
\BOOKMARK [2][-]{subsection.3.5.1}{Schutzma\337name: Zugriffskontrollsystem}{section.3.5}% 37
|
|
\BOOKMARK [1][-]{section.3.6}{Nichtabstreitbarkeit, Verbindlichkeit}{chapter.3}% 38
|
|
\BOOKMARK [2][-]{subsection.3.6.1}{Schutzma\337name: Signaturen und PKI}{section.3.6}% 39
|
|
\BOOKMARK [1][-]{section.3.7}{Verf\374gbarkeit}{chapter.3}% 40
|
|
\BOOKMARK [2][-]{subsection.3.7.1}{Schutzma\337nahmen}{section.3.7}% 41
|
|
\BOOKMARK [1][-]{section.3.8}{Anonymit\344t}{chapter.3}% 42
|
|
\BOOKMARK [0][-]{chapter.4}{Verschl\374sselungsverfahren}{}% 43
|
|
\BOOKMARK [1][-]{section.4.1}{Das Kerckhoffs'sche Prinzip}{chapter.4}% 44
|
|
\BOOKMARK [1][-]{section.4.2}{Mathematische Modelierung von Verschl\374sselungsverfahren}{chapter.4}% 45
|
|
\BOOKMARK [1][-]{section.4.3}{Schl\374sselaustausch}{chapter.4}% 46
|
|
\BOOKMARK [1][-]{section.4.4}{Angriffsszenarien}{chapter.4}% 47
|
|
\BOOKMARK [2][-]{subsection.4.4.1}{Ciphertext-only Angriffe}{section.4.4}% 48
|
|
\BOOKMARK [2][-]{subsection.4.4.2}{Known-plaintext Angriffe}{section.4.4}% 49
|
|
\BOOKMARK [2][-]{subsection.4.4.3}{Chosen-plaintext Angriffe}{section.4.4}% 50
|
|
\BOOKMARK [1][-]{section.4.5}{Brute-Force Angriffe}{chapter.4}% 51
|
|
\BOOKMARK [2][-]{subsection.4.5.1}{Beispiel: Brute-Force Angriff auf k}{section.4.5}% 52
|
|
\BOOKMARK [2][-]{subsection.4.5.2}{Beispiel: Brute-Force Angriff auf m}{section.4.5}% 53
|
|
\BOOKMARK [2][-]{subsection.4.5.3}{Anforderungen zum Schutz vor Brute-Force}{section.4.5}% 54
|
|
\BOOKMARK [1][-]{section.4.6}{W\366rterbuchangriffe}{chapter.4}% 55
|
|
\BOOKMARK [2][-]{subsection.4.6.1}{Schutz vor W\366rterbuchangriffen}{section.4.6}% 56
|
|
\BOOKMARK [0][-]{chapter.5}{Stromverschl\374sselungsverfahren}{}% 57
|
|
\BOOKMARK [1][-]{section.5.1}{Synchrone Stromverschl\374sselungsverfahren}{chapter.5}% 58
|
|
\BOOKMARK [1][-]{section.5.2}{Zustandsabh\344ngige Stromverschl\374sselungsverfahren}{chapter.5}% 59
|
|
\BOOKMARK [2][-]{subsection.5.2.1}{Additive zustandsabh\344ngige Stromverschl\374sselungsverfahren}{section.5.2}% 60
|
|
\BOOKMARK [1][-]{section.5.3}{Schl\374sselstrom vs. One-Time-Pad}{chapter.5}% 61
|
|
\BOOKMARK [1][-]{section.5.4}{Nonces zur Initialisierung eines Schl\374sselstromgenerators}{chapter.5}% 62
|
|
\BOOKMARK [1][-]{section.5.5}{ChaCha20}{chapter.5}% 63
|
|
\BOOKMARK [1][-]{section.5.6}{Cipher-Instanzen: Verschl\374sselungsalgorithmen in Java-Laufzeitumgebungen}{chapter.5}% 64
|
|
\BOOKMARK [0][-]{chapter.6}{Blockverschl\374sselungsverfahren}{}% 65
|
|
\BOOKMARK [1][-]{section.6.1}{Padding-Verfahren}{chapter.6}% 66
|
|
\BOOKMARK [1][-]{section.6.2}{Betriebsmodi}{chapter.6}% 67
|
|
\BOOKMARK [2][-]{subsection.6.2.1}{ECB \(Electronic Code Book\)}{section.6.2}% 68
|
|
\BOOKMARK [2][-]{subsection.6.2.2}{CBC \(Cipher Block Chaining\)}{section.6.2}% 69
|
|
\BOOKMARK [2][-]{subsection.6.2.3}{CBC-CS \(Chiphertext Stealing for CBC Mode\)}{section.6.2}% 70
|
|
\BOOKMARK [2][-]{subsection.6.2.4}{CTR \(Counter\)}{section.6.2}% 71
|
|
\BOOKMARK [2][-]{subsection.6.2.5}{OFB \(Output Feedback\)}{section.6.2}% 72
|
|
\BOOKMARK [2][-]{subsection.6.2.6}{CFB \(Cipher-Feedback\)}{section.6.2}% 73
|
|
\BOOKMARK [1][-]{section.6.3}{Konstruktionsprinzipien von Blockverschl\374sselungsverfahren}{chapter.6}% 74
|
|
\BOOKMARK [1][-]{section.6.4}{DES}{chapter.6}% 75
|
|
\BOOKMARK [2][-]{subsection.6.4.1}{Triple-DES \(3DES\)}{section.6.4}% 76
|
|
\BOOKMARK [1][-]{section.6.5}{Meet-in-the-Middle-Angriff}{chapter.6}% 77
|
|
\BOOKMARK [1][-]{section.6.6}{AES \(Advanced Encryption Standard\)}{chapter.6}% 78
|
|
\BOOKMARK [2][-]{subsection.6.6.1}{AES-128}{section.6.6}% 79
|
|
\BOOKMARK [0][-]{chapter.7}{Hashfunktionen}{}% 80
|
|
\BOOKMARK [1][-]{section.7.1}{schwache Kollisionsfreiheit}{chapter.7}% 81
|
|
\BOOKMARK [1][-]{section.7.2}{MessageDigest-Instanzen: Hashfunktionen in Java}{chapter.7}% 82
|
|
\BOOKMARK [1][-]{section.7.3}{Anwendungsbeispiele}{chapter.7}% 83
|
|
\BOOKMARK [2][-]{subsection.7.3.1}{Anwendungsbeispiel: Passwortdatei}{section.7.3}% 84
|
|
\BOOKMARK [2][-]{subsection.7.3.2}{Anwendungsbeispiel: Integrit\344tsschutz von Dateien}{section.7.3}% 85
|
|
\BOOKMARK [2][-]{subsection.7.3.3}{Anwendungsbeispiel: Integrit\344tsschutz bei einem Dateidownload}{section.7.3}% 86
|
|
\BOOKMARK [1][-]{section.7.4}{Brute-Force-Angriffe auf Hashfunktionen}{chapter.7}% 87
|
|
\BOOKMARK [2][-]{subsection.7.4.1}{Brute-Force-Urbildsuche}{section.7.4}% 88
|
|
\BOOKMARK [2][-]{subsection.7.4.2}{Brute-Force-Kollisionssuche}{section.7.4}% 89
|
|
\BOOKMARK [1][-]{section.7.5}{Konstruktionsverfahren von Hashfunktionen}{chapter.7}% 90
|
|
\BOOKMARK [0][-]{chapter.8}{MAC-Verfahren}{}% 91
|
|
\BOOKMARK [1][-]{section.8.1}{HMAC}{chapter.8}% 92
|
|
\BOOKMARK [1][-]{section.8.2}{CMAC, CBC-MAC}{chapter.8}% 93
|
|
\BOOKMARK [2][-]{subsection.8.2.1}{CMAC}{section.8.2}% 94
|
|
\BOOKMARK [2][-]{subsection.8.2.2}{CBC-MAC}{section.8.2}% 95
|
|
\BOOKMARK [0][-]{chapter.9}{Modulare Arithmetik - Teil 2}{}% 96
|
|
\BOOKMARK [1][-]{section.9.1}{Potenzen}{chapter.9}% 97
|
|
\BOOKMARK [2][-]{subsection.9.1.1}{Erzeugnis und Ordnung eines invertierbaren Elements}{section.9.1}% 98
|
|
\BOOKMARK [2][-]{subsection.9.1.2}{Faktorenzerlegung}{section.9.1}% 99
|
|
\BOOKMARK [2][-]{subsection.9.1.3}{Kleiner Satz von Fermat}{section.9.1}% 100
|
|
\BOOKMARK [2][-]{subsection.9.1.4}{Berechnung modularer Potenzen}{section.9.1}% 101
|
|
\BOOKMARK [1][-]{section.9.2}{Exkurs: Einheitengruppe Zpe*}{chapter.9}% 102
|
|
\BOOKMARK [2][-]{subsection.9.2.1}{Z2e*}{section.9.2}% 103
|
|
\BOOKMARK [1][-]{section.9.3}{Der chinesische Restsatz}{chapter.9}% 104
|
|
\BOOKMARK [2][-]{subsection.9.3.1}{Beispiel}{section.9.3}% 105
|
|
\BOOKMARK [1][-]{section.9.4}{Elemente gerader und ungerader Ordnung in Zn**}{chapter.9}% 106
|
|
\BOOKMARK [0][-]{chapter.10}{Das Diffie-Hellman-Schl\374sselaustauschverfahren}{}% 107
|
|
\BOOKMARK [1][-]{section.10.1}{Das DH-Verfahren in Einzelschritten}{chapter.10}% 108
|
|
\BOOKMARK [1][-]{section.10.2}{Das Diskrete-Logarithmus-Problem \(DL-Problem\)}{chapter.10}% 109
|
|
\BOOKMARK [2][-]{subsection.10.2.1}{Das Diffie-Hellman-Problem \(DH-Problem\)}{section.10.2}% 110
|
|
\BOOKMARK [1][-]{section.10.3}{Beispielanwendung des DH-Verfahrens}{chapter.10}% 111
|
|
\BOOKMARK [1][-]{section.10.4}{Angriffe auf das DH-Verfahren}{chapter.10}% 112
|
|
\BOOKMARK [2][-]{subsection.10.4.1}{Pohlig-Hellman-Reduktion}{section.10.4}% 113
|
|
\BOOKMARK [2][-]{subsection.10.4.2}{Shanks' \214Baby Steps Giant Steps\215-Verfahren \(BSGS-Verfahren\)}{section.10.4}% 114
|
|
\BOOKMARK [2][-]{subsection.10.4.3}{Pollard's Rho-Methode}{section.10.4}% 115
|
|
\BOOKMARK [2][-]{subsection.10.4.4}{Zahlk\366rpersieb}{section.10.4}% 116
|
|
\BOOKMARK [0][-]{chapter.11}{Das RSA-Verfahren}{}% 117
|
|
\BOOKMARK [1][-]{section.11.1}{RSA-Schl\374sselpaare}{chapter.11}% 118
|
|
\BOOKMARK [2][-]{subsection.11.1.1}{Beispiel f\374r die Schl\374sselpaarerstellung}{section.11.1}% 119
|
|
\BOOKMARK [1][-]{section.11.2}{RSA-Verschl\374sselungsverfahren}{chapter.11}% 120
|
|
\BOOKMARK [2][-]{subsection.11.2.1}{Beispiel f\374r die Verschl\374sselung}{section.11.2}% 121
|
|
\BOOKMARK [1][-]{section.11.3}{Padding}{chapter.11}% 122
|
|
\BOOKMARK [2][-]{subsection.11.3.1}{Padding nach PKCS\0431}{section.11.3}% 123
|
|
\BOOKMARK [2][-]{subsection.11.3.2}{Optimal Asymmetric Encryption Padding\(OAEP\)}{section.11.3}% 124
|
|
\BOOKMARK [1][-]{section.11.4}{Das RSA-Signaturverfahren}{chapter.11}% 125
|
|
\BOOKMARK [2][-]{subsection.11.4.1}{Beispiel f\374r ein RSA-Signaturverfahren}{section.11.4}% 126
|