Karteikarten
Cryptanalysis and brute force attack
Karten in diesem Stapel (6)
- 1Brute Force Attack- Attacker tries all possible keys on a cipher text until a legible plaintext is obtained (this is always possible unless unknown language)
- On avergae, half of all possible keys need to be tried in order to achieve success (cost heavily depends on key size) - 2Cryptanalytic attack- Attack relies on the nature of the algorithm, can also rely on knowledge of plain text or cipher text pairs
- Exploits the characteristics of the alogrithm to deduce a specific plaintext or key - 3Adversary (input)Whatever the adversary knows from the beginning
- 4Adversary (Oracle)Models information adversary could obtain during the attack
- 5Adversary (output)Whatever the adversary is looking to compute, key, plaintext, information
- 6Definition (security)- Specify potential oracle
- Define what the adversary needs to do to be successful
- The system is secure if with an efficient adversary there is negligable chance of them winning
Informationen
- Beschreibung
- Karteikarten am Cryptanalysis and brute force attack, erstellt von Aaron A Hamilton am 30/12/2014.
- Erstellt von
- Aaron A Hamilton
- Aufrufe
- 1
- Bewertung