Presentation title:

Symmetric Cryptography (AES) and

Asymmetric Cryptography(RSA, ECC & HECC)

Presented by:
Irshad Ullah
MS(CS) 3rd Semester

Department of Information Technology hazara University, Mansehra

Advance Encryption Standard(AES)
• AES was announced by National Institute of Standards and Technology(NIST ) in
2002
• AES was first published as Rijndael in the year 1998
• As of 2009 ,AES is one of the most popular algorithms used in symmetric key
cryptography. It is available in many different encryption packages. AES is the first
publicly accessible and open cipher approved by the NSA for top secret
information.
• Symmetric key Cryptography is a form of cryptosystem in which encryption and
decryption are performed the same keys
• It is also known as secret key cryptography
Drawbacks of DES Algorithm

• DES is considered to be insecure for many applications .

• The main reason the insecurity of DES is it’s Key length.
• The Key length of DES is 56 bits. NSA claimed that the key length is
too small.
• In January, 1999, distributed.net and the Electronic Frontier
Foundation collaborated to publicly break a DES key in 22 hours and
15 minutes
Features of AES
• Symmetric Cipher
• Fixed Block length(128 bits)
• Variable Key length (128,192,256)bits
• Variable Number of Rounds(10,12,14)
• Available in three different Version(AES-128, AES192, AES
256)
• Certified by CRYPTREC, NESSIE, NSA, AES Winner
Description of Algorithm
Key Expansion
• Initial Round
• 1.Add RoundKey
Rounds
• 1. SubBytes
• 2. Shift Rows
• 3. Mix Columns
• 4. Add RoundKey
Final Round
• 1.SubBytes
• 2.ShiftRows
• 3.AddRoundKey
Sub Bytes
Shift Rows
Mix Columns
Add Round Key
Advantages
• Fast in it’s execution
• Requires less Memory
• complex (secure)
RSA (Rivest, Shamir and Adleman)
• Public key Cryptography is a form of cryptosystem in which encryption and
decryption are performed the different keys
• One a public key and one a private key
• It is also known as public key cryptography
• It can be used for confidentiality ,authentication or both
• The concept of public key cryptography evolved from an attempt to attack two of
the most difficult problems associated with symmetric encryption
• The first problem is that of the key distribution
• The second problem that of Digital signature
• A brute-force attack vulnerable to every algorithm
RSA…
• RSA Developed by three person Rivest, Shamir and Adleman in 1977
• Finally design in 1978 by MIT(Massachusetts Institute of Technology)
• RSA is popular Public key Algorithm
• The RSA scheme is a block cipher in which the plaintext and cipher-
text are integer b/w 0 and n-1 for some n
• A typical size for n is 1024 bits
 RSA Algorithm
• Choose two distinct large prime numbers p and q such that p≠q

• Calculate that n = p*q.

• Choose e (public key) such that e is not a factor of (p-1) and (q-1)
Or
• e is not a factor of (p-1)(q-1)
• Choose d (private key) such that (d*e) mod (p-1)(q-1)=1

• Cipher text (C.T) = (𝑃. 𝑇)𝑒 mod n

• Plain text (P.T) = (𝐶. 𝑇)𝑑 mod n

Example On RSA
• Plain text = 5
• Which send over the channel “A” to “B” securely
• So
• Select p=7 and q=11
• Step i. 7≠11
• Step ii. n =p*q
• n=7*11 =77
• Step iii. (p-1)(q-1)
• (7-1) * (11-1) = (6) * (10) = 60
• Note: factor of 60 is 1,2,3,5,6,10,12,15,20,30,60 so we does not select no in
this factor
• Select no which not factor of 60 the number are 7,8,11,13…..59
• For example we select 13 as e.
• So e = 13
• Step iv: (d * e) mod 60 =1
• Note :Randomly select no one by one still d * e mod 60 = 1 which is 37
• So d = 37
• 37 * 13 mod of 60 = 1
• Step v. C.T = 513 mod 77
• After calculation result of step v is C.T= 26
• Note: where 5 is plain text which convert to cipher text 26
• Step vi. P.T = 2637 mode 77
• P.T = 5
• where 26 is cipher text which convert to plain text 26 again
Elliptic Curve Cryptography (ECC)
• Originally introduced in 1985
• Asymmetric /public key method
• Similar to RSA in application, but more complex math is used
• Key size 160 bits
• Utilize the mathematics behind equation of Elliptic curve(EC)
• Basic equation EC: 𝑦 2 = 𝑥 3 +ax + b where a and b are constant
• ECC use for key exchange and encryption
• A common version of ECC is ECC with Diffie Hellman
o Equation: 𝑦 2 = 𝑥 2 +ax + b (mode p)
o P is a prime number
Key exchange is exactly the same as Diffie Hellman, but uses elliptic
curve math
Current status and application
• Used by:
o US government
o Tor
o Bitcoin
o iMessage( instant message))
o SSL/TSL
o Mobile and embedded
o more
Advantages and disadvantages

oRelies on difficult of elliptic curve discrete logarithm

oOffers similar strength with smaller keys
oFaster, but more secure
• Similar Diffie Hellman Attacks (e.g. Logjam attack against the TLS protocol:
This allows the attacker to read and modify any data passed over the
connection)
HECC (Hyper elliptic curve cryptography)
• A hyper elliptic curve C of genus g defined over a field Fq of
characteristic p is
• given by an equation of the form
𝑦 2 + h(x)y = f(x)
• where h(x) and f(x) are polynomials with coefficients in Fq
• There are three types of genus (mean loop or hole)
o Genus 2(80 bits)
o Genus 3(54 bits)
o Genus 4(40 bits)
• In HECC 40 to 80 bits key are used.
• Less than 40 bits key is not suitable for cryptography
Thanks