Scribd
Upload
9 views24 pages

Lecture 9

The document provides an overview of encryption methods, focusing on stream and block ciphers, particularly the Data Encryption Standard (DES). DES, which was widely used until the introduction of AES in 2001, encrypts data in 64-bit blocks using a 56-bit key and has applications in financial security. The document also discusses the strengths and vulnerabilities of DES, including the avalanche effect and potential timing attacks.

Uploaded by

lenroydesouza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views24 pages

Lecture 9

The document provides an overview of encryption methods, focusing on stream and block ciphers, particularly the Data Encryption Standard (DES). DES, which was widely used until the introduction of AES in 2001, encrypts data in 64-bit blocks using a 56-bit key and has applications in financial security. The document also discusses the strengths and vulnerabilities of DES, including the avalanche effect and potential timing attacks.

Uploaded by

lenroydesouza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

INTRODUCTION AND

NUMBER THEORY
Prof. Saurabh Kulkarni
Department of Artificial Intelligence & Data Science
AGENDA FOR TODAY
• Recap of last lecture
• Block and stream cipher overview
• Data Encryption Standard
• Clicker activity
• Summary/ Conclusion
STREAM CIPHERS
• Encrypts a digital data stream one bit or one byte at a
time
• Examples of classical stream ciphers are the autokeyed
Vigenère cipher and the Vernam cipher
• If the cryptographic keystream is random, then this cipher
is unbreakable by any means other than acquiring the
keystream
• The keystream must be provided to both users in advance
via some independent and secure channel
STREAM CIPHERS
BLOCK CIPHER
• A block cipher is one in which a block of plaintext is
treated as a whole and used to produce a ciphertext block
of equal length
• Typical block size- 64 bits or 128 bits
• 2 users share symmetric encryption key
• A block cipher can be used to achieve same effect as
stream cipher
BLOCK CIPHER
DES (DATA ENCRYPTION
STANDARD)
• Until the introduction of the Advanced Encryption
Standard (AES) in 2001, the Data Encryption Standard
(DES) was the most widely used encryption scheme
• DES was issued in 1977 by National Institute of Standards
and Technology (NIST)
• The algorithm is Data Encryption Algorithm (DEA)
• Data are encrypted in 64-bit blocks using a 56-bit key
• Algorithm transforms 64-bit input in a series of steps into
a 64-bit output and same steps, with the same key, are
used to reverse the encryption
DES (DATA ENCRYPTION
STANDARD)
• Dominant in financial application security
• Now its only used in legacy systems and triple DES is
used in many applications
DES ENCRYPTION SCHEME
DES ENCRYPTION SCHEME
• There are two inputs to the encryption function: the
plaintext to be encrypted and the key
• The plaintext must be 64 bits in length and the key is 56
bits in length
• First, the 64-bit plaintext passes through an initial
permutation (IP) that rearranges the bits to produce the
permuted input
• This is followed by a phase consisting of sixteen rounds of
the same function, which involves both permutation and
substitution functions
DES ENCRYPTION SCHEME
• The output of the last round consists of 64 bits that are a
function of the input plaintext and the key
• The left and right halves of the output are swapped to
produce the preoutput
• Finally, the preoutput is passed through a permutation [IP-
1
] that is the inverse of the initial permutation function, to
produce the 64-bit ciphertext
DES ENCRYPTION SCHEME
• The right-hand portion of the diagram shows the way in
which the 56-bit key is used
• Initially, the key is passed through a permutation
function. Then, for each of the sixteen rounds, a subkey
(Ki) is produced by the combination of a left circular shift
and a permutation
• The permutation function is the same for each round, but
a different subkey is produced because of the repeated
shifts of the key bits
DES DECRYPTION
• Decryption uses the same algorithm as encryption,
except that the application of the subkeys is reversed
• Additionally, the initial and final permutations are
reversed
SELF-STUDY MATERIAL
• Kindly study the example given in the following URL to
understand internal working of DES in detail.
• https://page.math.tu-berlin.de/~kant/teaching/hess/krypt
o-ws2006/des.htm
DES EXAMPLE
DES EXAMPLE
AVALANCHE EFFECT
• A desirable property of any encryption algorithm is that a
small change in either the plaintext or the key should
produce a significant change in the ciphertext
• A change in one bit of the plaintext or one bit of the key
should produce a change in many bits of the ciphertext
• This is referred to as the avalanche effect
• If the change were small, this might provide a way to
reduce the size of the plaintext or key space to be
searched
AVALANCHE EFFECT IN DES:
CHANGE IN PLAINTEXT
AVALANCHE EFFECT IN DES:
CHANGE IN KEY
STRENGTH OF DES: USE OF 56-BIT KEYS

• With a key length of 56 bits, there are 2^56 possible


keys, which is approximately 7.2 * 10^16 keys
• On the face of it, a brute-force attack appears impractical
• Assuming that, on average, half the key space has to be
searched, a single machine performing one DES
encryption per microsecond would take more than a
thousand years to break the cipher
• However, the assumption of one encryption per
microsecond is overly conservative
STRENGTH OF DES: USE OF 56-BIT KEYS

• As far back as 1977, Diffie and Hellman postulated that


the technology existed to build a parallel machine with 1
million encryption devices, each of which could perform
one encryption per microsecond
• This would bring the average search time down to about
10 hours
• With current technology, the speed of commercial, off-
the-shelf processors threaten the security of DES
• A recent paper from Seagate Technology suggests that a
rate of 1 billion (10^9) key combinations per second is
reasonable for today’s multicore computers
STRENGTH OF DES: USE OF 56-BIT KEYS

• Tests run on a contemporary multicore Intel machine resulted in an


encryption rate of about half a billion encryptions per second
• Another recent analysis suggests that with contemporary supercomputer
technology, a rate of 10^13 encryptions per second is reasonable
STRENGTH OF DES: NATURE OF DES
ALGORITHM

• Another concern is the possibility that cryptanalysis is


possible by exploiting the characteristics of the DES
algorithm
• The focus of concern has been on the eight substitution
tables, or S-boxes, that are used in each iteration
• Because the design criteria for these boxes, and indeed
for the entire algorithm, were not made public, there is a
suspicion that the boxes were constructed in such a way
that cryptanalysis is possible for an opponent who knows
the weaknesses in the S-boxes
STRENGTH OF DES: TIMING
ATTACKS
• Timing attack is one in which information about the key or
the plaintext is obtained by observing how long it takes a
given implementation to perform decryptions on various
ciphertexts
• Timing attack exploits the fact that an encryption or
decryption algorithm often takes slightly different
amounts of time on different inputs
• This is a long way from knowing the actual key, but it is
an intriguing first step
• DES appears to be fairly resistant to a successful timing
attack but suggest some avenues to explore

You might also like