Term Project Presentation

on

IMPLEMENTATION
OF
RSA ALGORITHM

Md Saif H2016124031
Mounesh H2016124024
Department of Electronics and Communication
BITS Pilani Hyderbad Campus

1
 OUTLINE

Motivation
Literature Review
Introduction
Design
Simulation Results & Discussion
Conclusion
References

2
 MOTIVATION

Being in todays technology and advancement of wireless and mobile communication

data security is a very important aspect.

Many transactions that occur online from banking to e commerce requires sensitive
information like credit card numbers internet banking passwords to be sent over
wireless channel which are subjected to attacks.

Hence need of the hour is develop ways to make our data secure. Many cryptographic
techniques are developed in this line like hash algorithm ,128 bit SSL(secure socket
layer) and many more . RSA Supplements these technologies for making data secure
RSA makes all these sensitive information secure by multilevel encryptions.

3
 ABSTRACT

In this Paper first we have implemented Basic RSA algorithm based on asymmetric
public key cryptography. Later we have enhanced the security of RSA cryptosystem, it
suggests the use of randomized parameters in the encryption process to make RSA
more secure. This enhancement will make use of two ciphers so that an attacker cannot
distinguish two encryptions from each other. Both Basic RSA and Modified RSA are
implemented on Matlab.

4
INTRODUCTION TO BASIC RSA ALGORITHM

5
Basic RSA algorithm includes three steps

1) Key generation (public and private key)

public key e
private key d

2) Encryption c = me mod n

3) Decryption m = cd mod n

6
 LITERATURE REVIEW

In 2011, Xin Zhou & Xiaofei Tang proposed an implementation of a complete and
practical RSA encrypt/decrypt solution based on the study of RSA public key
algorithm. [1]

In 2012 the paper was presented at Computers & Informatics (ISCI), 2012 IEEE
Symposium which proposed the enhancing the security RSA algorithm through use of
fake modulus instead of product of two prime numbers . [2]

[1]Xin Zhou ,Xiaofei Tang, Research and implementation of RSA algorithm for encryption and
decryption. Strategic Technology (IFOST), 2011 6th International Forum .Sep 2011,China.

[2]Enhancing security features in RSA cryptosystemIEEE Symposium on Computers and

Informatics,Malaysia ,2012.

7
In 2012, Alaa Hussein Al-Hamami presented paper at Advanced Computer Science
Applications and Technologies (ACSAT) which proposed enhancing the RSA
algorithm through the use of additional third prime number in the composition of the
public and private key.[3]

[3]Alaa Hussein Al-Hamami, Ibrahem Abdallah Aldariseh, Enhanced Method for RSA
Cryptosystem Algorithm. Advanced Computer Science Applications and Technologies (ACSAT),
2012 International Conference .Nov 2012,Malaysia.

8
 PROPOSED DESIGN

RSA algorithm can be improved in two areas
1. Security
2. Time

We aim to increase the security of Basic RSA algorithm by introducing randomness in

encryption process
In proposed scheme we will be sending two ciphers
One cipher is calculated using random number
The other cipher will contain the information about the message text
: from random number selected
: from the message text and chosen random number
Attacker has to break two ciphers to retrieve the message

9
 IMPLEMENTATION

Generation of keys
As compared to basic RSA where 2 keys are generated we will be generating three
keys thus increasing the security
Generation of public key e
Choose two large prime numbers p and q find n and totient function (n)
n=p*q
(n) =(p-1)*(q-1)
Next we compute "e " as
gcd[e, (n) ] = 1
where 1 < e < <(n)
Generation of Private key d
Private key d is calculated using
(d * e) % (n) = 1

10

Generation of random key k [ Modified part]
we compute k " as
gcd[k, n ] = 1 where 1 < k< <n

Encryption:
In our modified RSA Encryption is two step process

1) In first step we calculate first cipher using and public key

=

2) In second step we encrypt our message using and public key

Final cipher that will sent to receiver is

11

Decryption
In our modified RSA decryption is three step process
1) First cipher is decrypted to get random number using private key

2) In second step we calculate unique integer using random number

such that

3) In third step we decrypt cipher using

12
RESULT OF BASIC RSA

13
RESULT OF MODIFIED RSA

14
 DISCUSSION ON RESULTS

Basic version RSA lacks randomization component and if attacker succeeds in

factorizing prime numbers. Then whole system is compromised.
As we have seen from the results we have increased security by multilevel encryption
and decryption. To decrypt the message attacker need , not only private key but also
random numbers k and s

15
 FUTURE WORK

We have concentrated on improving the security of RSA crypto system by multilevel

encryption and decryption process which obviously is achieved at the cost of
Encryption and decryption time.

One can also improve RSA in the area of Time taken to encrypt and decrypt the
message. Like offline key generation , creating ready to use look up table for keys etc.

16
 REFERENCES

Ranjan Bose Information theory, coding and cryptography, 2014, pp. 283-294.

Xin Zhou , Xiaofei Tang, Research and Implementation of RSA Algorithm for Encryption and
Decryption , The 6th International Forum on Strategic Technology, China,2011

Alaa Hussein Al-Hamami, Ibrahem Abdallah Aldariseh , Enhanced Method for RSA Cryptosystem
Algorithm Advanced Computer Science Applications and Technologies (ACSAT), 2012 International
Conference, Jordan, 2012

Enhancing Security Features in RSA Cryptosystem, IEEE Symposium on Computers & Informatics,2012

M. Bahadori, M. R. Mali, O. Sarbishei, M. Atarodi and M. Sharifkhani A novel approach for secure and
fast generation of RSA public and private keys on SmartCard NEWCAS Conference (NEWCAS), 2010
8th IEEE International, 2010, pp. 265-268.

H. Ge and S. R. Tate Efficient Authenticated Key-Exchange for Devices with a Trusted Manager
Information Technology: New Generations, 2006 (ITNG2006). Third International Conference on, 2006,
pp.198-203

17