010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Das one-time Pad Klartext a1 a2 ... an Geheimtext a1+k1 ... an+kn 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Das one-time Pad Nach Gilbert S. Vernam - Allgemein Klartext a1 a2 ... an Geheimtext a1+k1 ... an+kn Schlüssel k1 k2 ... kn Input Verarbeitung Output 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Das one-time Pad Klartext (binär) 0100111010011011010100 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Das one-time Pad Binärrechnung mit XOR Praktisches Beispiel 0  0 = 0 1  0 = 1 0  1 = 1 1  1 = 0 Klartext (binär) 0100111010011011010100 Geheimtext (binär) 1000010100110010111001 Schlüssel (binär) 1100101110101001101101 Input Verarbeitung Output 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Das one-time Pad Vorteile: Nachteile: 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Das one-time Pad Vor- und Nachteile Vorteile: - Einfache Verarbeitung – ideal für den Computer, da es binär arbeitet. - Leicht verständlich. - Absolut sicher. Nachteile: - Der Schlüssel muss mindestens so lang sein wie der Klartext. - Erschwerter Schlüsseltausch 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Das one-time Pad ASCII - Tabelle Zeichen ASCII-Code A 65 N 78 B 66 O 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Das one-time Pad Programmbeispiel: Hyroglyphica ASCII - Tabelle Zeichen ASCII-Code A 65 N 78 B 66 O 79 C 67 P 80 D 68 Q 81 E 69 R 82 F 70 S 83 G 71 T 84 H 72 U 85 I 73 V 86 J 74 W 87 K 75 X 88 L 76 Y 89 M 77 Z 90 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Das one-time Pad rot grün blau 77 88 140 + = 77 + 6 = 94 + 5 = 145 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Das one-time Pad Programmbeispiel: Hyroglyphica A = 65 A = 0  100 + 6  10 + 5  1 rot grün blau 77 88 140 + = 77 + 6 = 94 + 5 = 145 Vorherige Farbe: Neue Farbe: 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Hyroglyphica Ausgangsbild (Schlüssel) Bild mit Geheimtext 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Hyroglyphica Ausgangsbild (Schlüssel) Bild mit Geheimtext 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Der Pseudozufallsgenerator 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Der Pseudozufallsgenerator Erweiterung des one-time Pads durch Register Klartext 0100111010011011010100 Geheimtext Schlüssel 1000010100110010111001 Pseudo- Zufalls- generator 1100101110101001101101 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Pseudozufallsgenerator 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Der Pseudozufallsgenerator Das Schieberegister – am Beispiel der Länge 4 Pseudozufallsgenerator Output 1 Initialisierung 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Pseudozufallsgenerator 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Der Pseudozufallsgenerator Das Schieberegister – am Beispiel der Länge 4 Pseudozufallsgenerator Output 1 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Pseudozufallsgenerator 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Der Pseudozufallsgenerator Das Schieberegister – am Beispiel der Länge 4 Pseudozufallsgenerator Output 00 1 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Pseudozufallsgenerator 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Der Pseudozufallsgenerator Das Schieberegister – am Beispiel der Länge 4 Pseudozufallsgenerator Output 000 1 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Pseudozufallsgenerator 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Der Pseudozufallsgenerator Das Schieberegister – am Beispiel der Länge 4 Pseudozufallsgenerator Output 1000 1 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Pseudozufallsgenerator 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Der Pseudozufallsgenerator Das Schieberegister – am Beispiel der Länge 4 Pseudozufallsgenerator Output 11010001101000 1 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Pseudozufallsgenerator 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Der Pseudozufallsgenerator Das Schieberegister – am Beispiel der Länge 4 – nichtlineare Rückkopplung Pseudozufallsgenerator Output (c4+1) · c3 + c1 + 1 100011001011101010011011 c1 c2 c3 c4 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Das asymmetrische Verschlüsselungsverfahren 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Das asymmetrische Verschlüsselungsverfahren Nach „New Directions in Cryptography“ von Whitfield Diffie und Martin Hellman Anschauliches Beispiel Ö F E N T L I C H 1 2 3 4 G.E. Heim Mr. X Dr. No T. Secret P R I V A T 1 2 3 4 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Das asymmetrische Verschlüsselungsverfahren 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Das asymmetrische Verschlüsselungsverfahren Mathematisch umgesetzt: Der RSA-Algorithmus Mathematisch umgesetzt von Ronald Rivest, Adi Shamir und Leonard Adleman R S A Wichtigstes Merkmal: 2 Schlüssel Öffentlicher Schlüssel Privater Schlüssel 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Das asymmetrische Verschlüsselungsverfahren 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Das asymmetrische Verschlüsselungsverfahren Mathematisch umgesetzt: Der RSA-Algorithmus Definitionen: p, q sind Primzahlen; p q = pq ist Teil des öffentlichen Schlüssels e ist der eigentliche öffentliche Schlüssel d ist der private Schlüssel m ist der Klartext; c ist der verschlüsselte Text 1. Auswählen von 2 möglichst großen p und q p = 2; q = 5; pq = 10 2. Berechnen von d und e – wobei e meist festgelegt wird und d anhand folgender Formel errechnet wird: e  d MOD (p-1)  (q-1) = 1 e = 7 7  d MOD 4 = 1  d = 3 3. Verschlüsseln des Klartextes mittels folgender Gleichung: c = m e MOD pq m = 8 c = 87 MOD 10  c = 2 4. Entschlüsseln des Geheimtextes m’ = c d MOD pq c = 2 m‘ = 23 MOD 10  m‘ = 8 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Unpolarisiertes Licht 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Die Quantenkryptographie Ein Ausblick in die Zukunft der Kryptographie Lichtquelle Unpolarisiertes Licht Polarisationsfilter Polarisiertes Licht 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

Die Quantenkryptographie 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 Die Quantenkryptographie Ein Ausblick in die Zukunft der Kryptographie One-pad Schlüssel  Checksum + Filtereinstellungen  PC 1 Netzwerk PC 2 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101

010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101 010011010111011110110110101110001101011110111010101011010101011011101101110101110001010111011101010101110110101000111000101101100000010110100011100110010100101101010101011010100010101110111010101011101101010001110001011011000000101101000 001011010110101011101010101010100010110011110011001000100011110010111001110011110101010101010011101010101011010101010001111100101001011100011100111001010111000011100011100111001011101010111010101010101110001010100100011110101010101010101