SAKET SANJAY DESHPANDE (101016653)

A Technical Comparison of AES and 3DES

Encryption Standards
Introduction to Cryptography: First subtopic
a) Definition By Definition the Cryptography is the science of using mathematics to

encrypt and decrypt data.

In other words, the practice of analysing the encoded messages in order to
decode them i.e. using the secret or enigmatical language.

b) Description

Cryptography enables you to store sensitive information or transmit it across

insecure networks so that it cannot be read by anyone except the intended

recipient.
While cryptography is the science of securing data, cryptanalysis is the science
of analysing and breaking secure communication. Classical cryptanalysis
involves an interesting combination of analytical reasoning, application of
mathematical tools, pattern finding, patience, determination, and luck.
Cryptanalysts are also called attackers. Cryptology embraces both

cryptography and cryptanalysis.

Cryptography can be strong or weak, as explained above. Cryptographic
strength is measured in the time and resources it would require to recover the
plaintext. The result of strong cryptography is cipher text that is very difficult

to decipher without possession of the appropriate decoding tool.

Cryptography is used to secure most aspects of Internet and Web uses that
require it, drawing on extensive set of protocols and tools designed for that

purpose
Encryption is the process by which one changes a message (called plaintext) in
order to render it unreadable to all but those possessing the decryption key.

The unreadable message is usually referred to as the cipher text.

Decryption is the inverse process which recovers the plaintext from the cipher
text.

Types of Cryptography: second subtopic

In general, three types of cryptographic schemes typically used:

secret key (or symmetric) Cryptography, public-key (or asymmetric)
cryptography, and hash functions

a) SYMMETRIC KEY CRYPTOGRAPHY

With secret key cryptography, a single key is used for both encryption and
decryption.

The sender uses the key (or some set of rules) to encrypt the plaintext and
sends the cipher text to the receiver .The receiver applies the same key (or
rule set) to decrypt the message and recover the plaintext. Because a single
key is used for both functions, secret key cryptography is also called
Symmetric encryption.

Each pair of users must have a unique key, so N users need N (N-1)/2 keys.

Secret key cryptography schemes are generally categorized as being

either stream ciphers or block ciphers.

Stream ciphers operate on a single bit at a time and implement some form
of feedback mechanism so that the key is constantly changing. A block
cipher is so- called because the scheme encrypts one block of data at a time
using the same key on each block.

The most commonly used algorithms in symmetric key cryptography to

encrypt the message are:
DES (Data Encryption Standard) and derivatives: double DES and
triple DES.
IDEA (International Data Encryption Algorithm)
Blowfish
RC5 (Rivets Cipher #5)
AES (Advance Encryption Standard)

Many tools are available and can be classified as

symmetric or asymmetric, each having advantages and special
capabilities.

b) ASYMMETRIC KEY CRYPTOGRAPHY

In Asymmetric cryptography, different keys are used for encryption

and decryption.

one key is kept secret and other is kept public but both are unique.

a two-key crypto system in which two parties could engage in a secure

communication over a non-secure communications channel without
having to share a secret key

One key is used to encrypt the plaintext and the other key is
used to decrypt the cipher text.

The recipients public key should be used during the encryption

process to ensure message confidentiality as only the recipient has the
necessary secret key to decrypt the message.

The important point here is that it does not matter which key is
applied first, but that both keys are required for the process to work.

Typically used asymmetric key algorithm includes:

RSA (Rivest, Shamir, Adleman)

DH (Diffie-Hellman Key Agreement Algorithm)

ECDH (Elliptic Curve Diffie-Hellman Key Agreement

Algorithm)

RPK (Raike Public Key)

C) Hash Functions:one-way hash function

A hash function, is a function that takes some message of any length as

input and transforms it into a fixed-length output called a hash value, a
message digest, a checksum, or a digital fingerprint.

A hash function is a function f : D R, where the domain D = {0, 1}

,which means that the elements of the domain consist of binary
string of variable length; and the range R = {0, 1} n for some n 1,
which means that the elements of the range are binary string of fixedlength.

So, f is a function which takes as input a message M of any size and

produces a fixed-length hash result h of size n.

Comparison Between AES, 3DES, DES :THIRD SUBTOPIC

ALGORITHMS

AES

DES

3DES

Key size

128,192,256

56 bits

112/168 bits

bits
Fast
Yes

Slow
Yes

Very slow
No

Slow

Very slow

Speed
Speed depends On keys?
Hardware

Very fast

implementations
Rounds
Developed
Encryption software
Security
Cipher type
Key distribution
Security

9,11,13
2000
Medium
Strong
Symmetric
Easy
Most secure

16
1978
Fast
Weak
Symmetric
Difficult
Insecure

48
1977
Slow
Inadequate
Symmetric
Moderate
More secure
Than DES

Block size

16

Conclusion:
In this assignment (analysis) we understood about the cryptography and
Many concepts of the cryptography like encryption and decryption,
Cryptonalysis, types of cryptography, etc.

We also understood and studied about algorithms like AES, DES AND
DES.how they work? What are their differences? What are the
advantages and disadvantages? which one is the better or more secure?
Few important concepts that we learnt by doing this analysis are as
follows:

AES IS THE MOST SECURE ALGORITHM AND ALSO HAS FASTER

HARDWARE IMPLEMENTATION.

Triple DES was the answer to many of the shortcomings of DES. Since it is
based on the DES algorithm, it is very easy to modify existing software to use
Triple DES.

Triple DES can be done using 2 keys or 3 keys.

DES IS THE MOST DIFFICULT ALGORITHM IN TERMS OF KEY

DISTRIBUTION.

ALL THREE ALGORITHMS ARE SUEFUL DEPENDING UPON THE

NEED OF THE USER.

Reference list:
Master of science thesis - Joseph Sterling Grah (book).
Cryptography and network security principles and practices
4th edition (book) by Willam Stallings.
Internet(Wikipediahttps://en.wikipedia.org/wiki/Cryptography).

Cryptography: An Introduction (3rd Edition) Nigel Smart