Partenaire Premium

CYG Chapter 3 Cryptanalysis of Classical Systems

Questions about the lecture 'Cryptography' of the RWTH Aachen Chapter 3 Cryptanalysis of Classical Systems

Questions about the lecture 'Cryptography' of the RWTH Aachen Chapter 3 Cryptanalysis of Classical Systems


Fichier Détails

Cartes-fiches 31
Langue English
Catégorie Informatique
Niveau Université
Crée / Actualisé 21.03.2017 / 17.08.2017
Attribution de licence Non précisé
Lien de web
https://card2brain.ch/box/20170321_cyg_chapter_3_cryptanalysis_of_classical_systems
Intégrer
<iframe src="https://card2brain.ch/box/20170321_cyg_chapter_3_cryptanalysis_of_classical_systems/embed" width="780" height="150" scrolling="no" frameborder="0"></iframe>

What is ‘Kerckhoffs’ principle’?

[cryptanalysis]

“The security of a cryptosystem shall not be based on the premise that the system itself is unknown to an opponent.”

What is the assumption?

[levels.cryptanalysis]

Oskar knows about the cryptosystem except of the key

What are the attacks?

[levels.cryptanalysis, 4]

1. CO

2. KP

3. CP

4. CC

What is the definition?

[CO.levels.cryptanalysis]

Only a string of ciphertext

What is the definition?

[KP.levels.cryptanalysis]

A string of ciphertext and the corresponding plaintext

What is the definition?

[CP.levels.cryptanalysis]

Access to the encryption function for any plaintext

What is the definition?

[CC.levels.cryptanalysis]

Access to the decryption function for any ciphertext

Which attacks are minimal requirements for a cryptosystem?

[levels.cryptanalysis, 2]

1. CO and 2. KP