Henric Johnson 1
Chapter 2 Chapter 2
Conventional Encryption Conventional Encryption Message Confidentiality Message Confidentiality
Henric Johnson Blekinge Institute of Technology, Sweden http://www.its.bth.se/staff/hjo/ henric.johnson@bth.se
Chapter 2 Chapter 2 Conventional Encryption Conventional - - PowerPoint PPT Presentation
Chapter 2 Chapter 2 Conventional Encryption Conventional Encryption Message Confidentiality Message Confidentiality Henric Johnson Blekinge Institute of Technology, Sweden http://www.its.bth.se/staff/hjo/ henric.johnson@bth.se Henric
Henric Johnson 1
Henric Johnson Blekinge Institute of Technology, Sweden http://www.its.bth.se/staff/hjo/ henric.johnson@bth.se
Henric Johnson 2
Henric Johnson 3
– Plaintext – Encryption algorithm – Secret Key – Ciphertext – Decryption algorithm
Henric Johnson 4
Henric Johnson 5
– The type of operations used for transforming plaintext to ciphertext – The number of keys used
– The way in which the plaintext is processed
Henric Johnson 6
2.15 milliseconds 232 = 4.3 x 109 32 5.9 x 1030 years 2168 = 3.7 x 1050 168 5.4 x 1018 years 2128 = 3.4 x 1038 128 10 hours 256 = 7.2 x 1016 56 Time required at 106 Decryption/µs Number of Alternative Keys Key Size (bits)
Henric Johnson 7
algorithms, including DES have a structure first described by Horst Feistel of IBM in 1973
the choice of the following parameters and design features (see next slide):
Henric Johnson 8
security
to greater difficulty of cryptanalysis.
execution of the algorithm becomes a concern
Henric Johnson 9
Henric Johnson 10
– The most widely used encryption scheme – The algorithm is reffered to the Data Encryption Algorithm (DEA) – DES is a block cipher – The plaintext is processed in 64-bit blocks – The key is 56-bits in length
Henric Johnson 11
Henric Johnson 12
Henric Johnson 13
– Li = Ri-1 – Ri = Li-1 F(Ri-1, Ki)
– The algorithm and the key length (56-bits) ⊗
Henric Johnson 14
6
Henric Johnson 15
algorithm (encrypt-decrypt-encrypt)
C = EK3[DK2[EK1[P]]]
Henric Johnson 16
Henric Johnson 17
(IDEA)
– 128-bit key – Used in PGP
– Easy to implement – High execution speed – Run in less than 5K of memory
Henric Johnson 18
– Suitable for hardware and software – Fast, simple – Adaptable to processors of different word lengths – Variable number of rounds – Variable-length key – Low memory requirement – High security – Data-dependent rotations
– Key size from 40 to 128 bits – The round function differs from round to round
Henric Johnson 19
– The input to the encryption algorithm is the XOR of the current plaintext block and the preceding ciphertext block. – Repeating pattern of 64-bits are not exposed
i i 1 i 1 i i K 1 i i 1 i i K i 1 i K K i K i 1 i k i
P P C C ] [C D C ) P (C ] [C D )] P (C [E D ] [C D ] P [C E C = ⊕ ⊕ = ⊕ ⊕ = ⊕ = ⊕ =
− − − − − −
Henric Johnson 20
Henric Johnson 21
– A lot of encryption devices – High level of security – Decrypt each packet at every switch
– The source encrypt and the receiver decrypts – Payload encrypted – Header in the clear
needed (see Figure 2.9)
Henric Johnson 22
Henric Johnson 23
1. A key could be selected by A and physically delivered to B. 2. A third party could select the key and physically deliver it to A and B. 3. If A and B have previously used a key, one party could transmit the new key to the other, encrypted using the
4. If A and B each have an encrypted connection to a third party C, C could deliver a key on the encrypted links to A and B.
Henric Johnson 24
– Data encrypted with a one-time session key.At the conclusion of the session the key is destroyed
– Used between entities for the purpose of distributing session keys
Henric Johnson 25
Henric Johnson 26
Security: Principles and Practice, 2nd edition. Prentice Hall, 1999
Wiley, 1996
Addison Wesley, 2001