7 - attack cryptography

20
Attack References: 1. Bruce, Applied Cryptography 2. William Stallings, Cryptography and Network Security 19/07/2022 1

Upload: annisa-sarah

Post on 23-Oct-2015

5 views

Category:

Documents


0 download

DESCRIPTION

it's about data security, cryptography will teach you about difficult algorithm to secure your datasdjgfdferbfqkdfnakjdfnvakjdfvnadfkvn vjnad vnd skjvnerfkehnfiukjnerqnjefjnqlkf herfjhqerjfnhqgqjnqighqiugrnfqer guqerhfiuqhnerfkjndkjfnasmdfgh;oergh[q'eghqlkdfnkQ34H8R329467-9

TRANSCRIPT

Page 1: 7 - Attack cryptography

17/0

4/20

23

AttackReferences:1. Bruce, Applied Cryptography2. William Stallings, Cryptography and Network Security

1

Page 2: 7 - Attack cryptography

17/0

4/20

23

Outlines

Brute force attack

Avalanche effect

Statistical attack

2

Page 3: 7 - Attack cryptography

17/0

4/20

23

Brute Force Attack

3

Page 4: 7 - Attack cryptography

17/0

4/20

23

Brute Force Attack (1)

Cryptanalysis• Cryptanalytic attacks rely on the nature of the algorithm

plus perhaps some knowledge of the general characteristics of the plaintext or some sample plaintext-ciphertext pairs.

• This attack exploits the characteristics of the algorithm to deduce a specific plaintext or to deduce the key being used.

Brute Force Attack• The attacker tries every possible key on a piece of

ciphertext until the plaintext is meaningful.4

Page 5: 7 - Attack cryptography

17/0

4/20

23

Brute Force Attack (2)• Brute force attack is one of ciphertext-only attack.• Attacker tries every possible key one by one until the resulting

plaintext is meaningful. • On average, half of all possible keys must be tried to achieve

success.

5

Page 6: 7 - Attack cryptography

17/0

4/20

23

Brute Force Attack (3)

• In Caesar Cipher, a brute force cryptanalysis is easily performed simply try all the 25 possible keys.

6

Page 7: 7 - Attack cryptography

17/0

4/20

23

Brute Force Attack (4)• Three important characteristics of this problem enabled us to

use a brute force cryptanalysis:

1. The encryption and decryption algorithms are known.

2. There are only 25 keys to try.

3. The language of the plaintext is known and easily recognizable.

7

Page 8: 7 - Attack cryptography

17/0

4/20

23

Brute Force Attack (5)• The use of an algorithm that employs a large number of keys

makes brute force cryptanalysis impractical.• The 3DES that makes use of a 168-bit key gives a key space of 2168

or greater than 3.7 x 1050 possible keys.

• If the language of the plaintext is unknown, then plaintext output may not be recognizable.• The input may be compressed in some fashion, again making

recognition difficult.

8

Page 9: 7 - Attack cryptography

17/0

4/20

23

Brute Force Attack (6)

• This figure shows a portion of a text file compressed using an algorithm called ZIP.

• If this file is then encrypted with a simple substitution cipher (expanded to include more than just 26 alphabetic characters), then the plaintext may not be recognized when it is uncovered in the brute force cryptanalysis. 9

Page 10: 7 - Attack cryptography

17/0

4/20

23

Brute Force Attack (7)• The greater security is achieved by greater resistance to brute

force attack and greater confusion.

• If attack succeeds in deducing the key, the effect is CATASTROPHIC all the future and past messages encrypted with that key are compromised.

10

Page 11: 7 - Attack cryptography

17/0

4/20

23

Avalanche Effect

11

Page 12: 7 - Attack cryptography

17/0

4/20

23

Avalanche Effect (1)• A small change in either the plaintext or the key should

produce a significant change in the ciphertext.• A one-bit change of key should produce a radical change in

the ciphertext using the same plaintext.• A one-bit change of plaintext should produce a radical

change in the ciphertext using the same key.

• In particular, a change in one bit of the plaintext or one bit of the key should produce a change in many bits of the ciphertext.

12

Page 13: 7 - Attack cryptography

17/0

4/20

23

Avalanche Effect (2)• In DES algorithm:• By allowing one bit to affect two substitutions (S-Box

Substitution and P-Box Substitution), the dependency of the output bits on the input bits spreads faster.

• After five rounds every ciphertext bit is a function of every plaintext bit and every key bit.

• After eight rounds the ciphertext was essentially a random function of every plaintext bit and every key bit.

13

Page 14: 7 - Attack cryptography

17/0

4/20

23

Avalanche Effect (3)• DES example

14

Page 15: 7 - Attack cryptography

17/0

4/20

23

Avalanche Effect (4)

15

Page 16: 7 - Attack cryptography

17/0

4/20

23

Avalanche Effect (5)• Avalanche effect in DES change in plaintext

16

Page 17: 7 - Attack cryptography

17/0

4/20

23

Avalanche Effect (6)• The fourth bit of the plaintext is changed, so that the plaintext

is 12468aceeca86420.

• The second column of the table shows the intermediate 64-bit values at the end of each round for the two plaintext.

• The third column shows the number of bits that differ between the two intermediate values.

• The table shows that, after just three rounds, 18 bits differ between the two blocks.

• On completion, the two ciphertexts differ in 32 bit positions.

17

Page 18: 7 - Attack cryptography

17/0

4/20

23

Avalanche Effect (7)• Avalanche effect in DES change in key

18

Page 19: 7 - Attack cryptography

17/0

4/20

23

Avalanche Effect (8)• The fourth bit of the key is changed, so that the key is

0f1571c947d9e859 (original key: 1f1571c947d9e859).

• The results show that about half of the bits in the ciphertext differ and the avalanche effect is pronounced after just a few rounds.

19

Page 20: 7 - Attack cryptography

17/0

4/20

23

HAPPY LEARNING!

20