11 views

Uploaded by AJER JOURNAL

Published monthly, online, open-access and having double-blind peer reviewed, American journal of Engineering Research (AJER) is an emerging academic journal in the field of Engineering and Technology which deals with all facets of the field of Technology and Engineering. This journal motive and aim is to create awareness, re-shaping the knowledge already created and challenge the existing theories related to the field of Academic Research in any discipline in Technology and Engineering. American journal of Engineering Research (AJER) has a primary aim to publish novel research being conducted and carried out in the domain of Engineering and Technology as a whole. It invites engineering, professors, researchers, professionals, academicians and research scholars to submit their novel and conjectural ideas in the domain of Engineering and Technology in the shape of research articles, book reviews, case studies, review articles and personal opinions that can benefit the engineering and technology researchers in general and society as a whole.

- Online Banking Security Level
- New Trends in Cryptography
- IRJET- A Two Symmetric Keys Technique to Encrypt/Decrypt Digital Colored Image to Minimize Loss
- CNS - QB - 2 & 16
- Ron Was Wrong, Whit is Right
- 30
- 8.Dbms Security
- ch07
- Hybrid Encryption Technique Using RSA with SHA-1 Algorithm in Data-At-Rest and Data-In-Motion Level
- CCNA Security Overview
- h 0315056
- Chapter 3 Review Questions
- Analization and Comparison of Selective Encryption Algorithms with Full Encryption for Wireless Networks
- Concept of Digital Signature
- Untitled
- Requirements Model.rtf
- Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks(2015)
- ANALYSIS OF SECURITY REQUIREMENTS OF FUTURISTIC MOBILE APPLICATIONS
- A Threshold Cryptosystem Without Trusted Party-pedersen
- 5.[29-38]a Practical Approach for Implementation of Public Key Infrastructure for Digital Signatures

You are on page 1of 7

2015

e-ISSN : 2320-0847 p-ISSN : 2320-0936

Volume-4, Issue-1, pp-143-149

www.ajer.org

Open Access

Research Paper

theory and public key cryptosystems

Israt Jahan, Mohammad Asif, Liton Jude Rozario

Department of Computer Science & Engineering, Jahangirnagar University, Savar, Dhaka, Bangladesh

Department of Computer Science & Engineering, Jahangirnagar University, Savar, Dhaka, Bangladesh

Department of Computer Science & Engineering, Jahangirnagar University, Savar, Dhaka, Bangladesh

ABSTRACT: Security is required to transmit confidential information over the network. Security is also

demanding in wide range of applications. Cryptographic algorithms play a vital role in providing the data

security against malicious attacks. RSA algorithm is extensively used in the popular implementations of Public

Key Infrastructures. In asymmetric key cryptography, also called Public Key cryptography, two different keys

(which form a key pair) are used. One key is used for encryption and only the other corresponding key must be

used for decryption. No other key can decrypt the message not even the original (i.e. the first) key used for

encryption. In this paper, we have proposed an improved approach of RSA algorithm using two public key pairs

and using some mathematical logic rather than sending one public key d irectly.Because if an attacker has an

opportunity of getting the public key componet they can find private key value by brute force search.

General Terms: Cryptography, network security

KEYWORDS: IRSA, RSA, security, cryptography

I.

INTRODUCTION

Number theory may be one of the purest branches of mathematics, but it has turned out to be one of

the most useful when it comes to computer security. Sensitive data exchanged between a user and a Web site

needs to be encrypted to prevent it from being disclosed to or modified by unauthorized parties. The encryption

must be done in such a way that decryption is only possible with knowledge of a secret decryption key. The

decryption key should only be known by authorized parties.

In traditional cryptography, such as was available prior to the 1970s, the encryption and decryption

operations are performed with the same key. This means that the party encrypting the data and the party

decrypting it need to share the same decryption key. Establishing a shared key between the parties is an

interesting challenge. If two parties already share a secret key, they could easily distribute new keys to each

other by encrypting them with prior keys. But if they dont already share a secret key, how do they establish the

first one? This challenge is relevant to the protection of sensitive data on the Web and many other applications

like it. This line of thinking in pre-Web terminology prompted two Stanford University researchers,

Whitfield Diffie and Martin Hellman, to write a landmark paper, New Directions in Cryptography in 1976 [6].

The paper suggested that perhaps encryption and decryption could be done with a pair of different keys rather

than with the same key. The decryption key would still have to be kept secret, but the encryption key could be

made public without compromising the security of the decryption key. This concept was called public-key

cryptography because of the fact that the encryption key could be made known to anyone.

The full public-key method would come a year later as an application of another famous problem,

integer factorization[11].

II.

RSA CRYPTOSYSTEM

The Rivest-Shamir-Adleman (RSA) cryptosystem is one of the best known public key cryptosystems

for key exchange or digital signatures or encryption of blocks of data. RSA uses a variable size encryption block

and a variable size key. The key-pair is derived from a very large number, n, that is the product of two prime

numbers chosen according to special rules; these primes may be 100 or more digits in length each, yielding an n

www.ajer.org

Page 143

2015

The public key information includes n and a derivative of one of the factors of n; an attacker cannot

determine the prime factors of n (and, therefore, the private key) from this information alone and that is what

makes the RSA algorithm so secure.

1. Generate two large random primes, p and q, of approximately equal size such that their product n = pq is of

the required bit length, e.g. 1024 bits.

2. Compute n = pq and () phi = (p-1)(q-1).

3. Choose an integer e, 1 < e < phi, such that gcd(e, phi) = 1.

4. Compute the secret exponent d, 1 < d < phi, such that ed 1 (mod phi).

5. The public key is (n, e) and the private key is (n, d). Keep all the values d, p, q and phi secret.

n is known as the modulus.

e is known as the public exponent or encryption exponent or just the exponent.

d is known as the secret exponent or decryption exponent.

2.2 Encryption Algorithm

Sender A does the following:1. Obtains the recipient B's public key (n, e).

2. Represents the plaintext message as a positive integer m

3. Computes the cipher text c = me mod n.

4. Sends the cipher text c to B.

2.3 Decryption Algorithm

Recipient B does the following:1. Uses his private key (n, d) to compute m = c d mod n.

2. Extracts the plaintext from the message representative m.

III.

NUMBER THEORY BEHIND RSA:

III.1 Prime Generation and Integer Factorization

Two basic facts and one conjecture in number theory prepare the way for todays RSA public-key cryptosystem.

FACT 1. Prime generation is easy: Its easy to find a random prime number of a given size.

This is a result of two other points: Prime numbers of any size are very common, and its easy to test whether a

number is a prime even a large prime.

According to the Prime Number Theorem, the expected number of candidates to test will be on the order of ln x

(the natural logarithm of x) where x is a typical number of the intended size.

Large in the cryptographic context typically means 512 bits (155 decimal digits) or more.

FACT 2. Multiplication is easy: Given p and q, its easy to find their product, n = pq.

There are many efficient ways to multiply two large numbers.

CONJECTURE 3. Factoring is hard: Given such an n, it appears to be quite hard to recover the prime factors p

and q.

Despite hundreds of years of study of the problem, finding the factors of a large number still takes a long time in

general. The fastest current methods are much faster than the simple approach of trying all possible factors one

at a time. (Such a method would take on the order of n steps.) However, they are still expensive. For instance, it

has been estimated recently that recovering the prime factors of a 1024-bit number would take a year on a

machine costing US $10 million. A 2048-bit number would require several billion times more work. [11]

III.2 Modular Exponentiation and Roots

Given this background, n will hereafter denote the product of two large, randomly generated primes.

Let m and c be integers between 0 and n-1, and let e be an odd integer between 3 and n-1 that is relatively prime

www.ajer.org

Page 144

2015

gcd(e,(p-1).(q-1))=1

The encryption and decryption operations in the RSA public-key cryptosystem are based on two more facts and

one more conjecture:

FACT 4.Modular exponentiation is easy: Given n, m, and e, its easy to compute c = me mod n.

The value me mod n is formally the result of multiplying e copies of m, dividing by n, and keeping the

remainder. This may seem to be an expensive computation, involving e-1 multiplications by m with increasingly

large intermediate results, followed by a division by n. However, two optimizations make the operation easy:

1. Multiplying by an appropriate sequence of previous intermediate values, rather than only by m, can

reduce the number of multiplications to no more than twice the size of e in binary.

2. Dividing and taking the remainder after each multiplication keeps the intermediate results the same

size as n [2].

FACT 5. Modular root extraction the reverse of modular exponentiation is easy given the prime

factors: Given n, e, c, and the prime factors p and q, its easy to recover the value m such that c = me mod n.

The value m can be recovered from c by a modular exponentiation operation with another odd integer d between

3 and n-1. In particular, for this d, the following holds for all m:

m = (me)d mod n .

This integer d is easy to compute given e, p, and q.

CONJECTURE 6. Modular root extraction is otherwise hard: Given only n, e, and c, but not the prime

factors, it appears to be quite hard to recover the value m.

We will want to compute d from e, p and q , where d is the multiplicative inverse of d. It means

e.d=1(mod (n))

IV.

PROPOSED IRSA(IMPROVED RSA)ALGORITHM

RSA is a block cipher in which the plaintext and cipher text are integers between 0 and n- 1 for some n.

Encryption and decryption are of the following form, for some plaintext block M and cipher text block C:

C = My/xmod n

M = Cdmod n = (My/x)dmod n.

Both sender and receiver must know the values of n, y and x only the receiver knows the value of d.

IV.1 Process of Encryption and Decryption:

This is a public key encryption algorithm with a public key of KU = {y,n},{x} and a private key of KR = {d,n}.

For this algorithm to be satisfactory for public-key encryption, the following requirements must be met:

1. It is possible to find values of y, x, d, n such that (My/x) d= M mod n for all M<n.

2. It is relatively easy to calculate My/x and Cd for all values of M <n.

3. y is a multiple of x and e (which the public key in the normal RSA algorithm )

www.ajer.org

Page 145

2015

IV.2 Computational Steps:

Begin by selecting two prime numbers, p and q, and calculating their product n, which is the modulus for

encryption and decryption.

Next, we need the quantity (n) referred to as the Euler totient of n, which is the number of positive integers

less than n and relatively prime to n.

Then select an integer e that is relatively prime to (n) (i.e., the greatest common divisor of e and (n) is 1).

Select two numbers x and y such that y=xe

Using this numbers formulate two public key {y,n},{x}

Finally, calculate d as the multiplicative inverse of e (which is public key in normal RSA), modulo (n).

Suppose that user A has published its public key and that user B wishes to send the message M to A.

Then B calculates C = My/x(mod n) and transmits C.

V.

EXPERIMENTAL RESULTS

In order to justify the performance we used different modulus length(256 bits, 512 bits,1024 bits)

and the block sizes (128 bits,256 bits,512 bits,1024 bits). The two following table shows the experimental

results of RSA and IRSA respectively.

bitlength(n)

256

512

1024

blocksize in

key generation(x) Encryption

Decryption

bits

MS

time(y)

time(z)

MS

MS

128

50

59

360

256

175

88

909

512

600

123

2710

Total time

t=x+y+z

MS

469

1172

3433

bit length(n)

blocksize in

bits

key generation(x)

MS

256

512

1024

128

256

512

63

187

612

Encryption

time(y)

MS

67

97

133

Decryption

time(z)

MS

368

918

2728

Total time

t=x+y+z

MS

498

1202

3473

www.ajer.org

Page 146

2015

From the above figure it is clear that the key generation time in IRSA is greater than RSA key generation time as

IRSA requires additional x and y to be generated.

The above figure shows the encryption time of RSA and IRSA. As it is seen from the figure that IRSA takes

more time than RSA to encrypt(in mili second),but the difference is very few.

The following figure shows the decryption time of RSA and IRSA and it is also of similar behaviour

like figure 5.2, that is decryption time of IRSA is more than RSA.

www.ajer.org

Page 147

2015

The total time comparison(including key generation,encryption and decryption)of RSA and IRSA is below:

The overall comparison between RSA and IRSA can be better seen from the following pi chart.

The table below shows the comparison between RSA and IRSA

TABLE 3: Table of comparison between RSA and IRSA

RSA

IRSA

Use only one public key

Use two public key

Less communication overload

Less secure

More secure

VI.

CONCLUSION

This research is a study of number theory and pulic key cryptosystems and based on this improving the

RSA cryptosystem that is more reliable to brute force attack.RSA cryptosystem produces one public key to

encrypt the message. Though it is hard to find out the factors of n and get p and q, two large prime numbers,

therefore brute force attack is more difficult in our proposed algorithm as the encryption keys are sent separtely,

not at once. The proposed RSA is used for system that needs high security but with less speed.

www.ajer.org

Page 148

2015

REFERENCES

[1] Shilpa M Pund, Chitra G Desai. Implemantation of RSA using Mersenne Prime. International Journal of Networking & Parallel

Computing. Volume 1, Issue 3, Dec 2012-Jan 2013.

[2] S. Sharma, J.S. Yadav, P. Sharma. Modified RSA Public Key Cryptosystem Using Short Range Natural Number Algorithm.

International Journal of Advanced Research in Computer Science and Software Engineering, volume 2, Issue 8, August 2012

[3] P.Saveetha,S. Arumugam, Study on improvement in RSA algorithm and its implementation.Volume 3, Issue 6,7,8 ,2012.

[4] P.S.Yadav, P. Sharma, Dr. K. P. Yadav, Implementation of RSA algorithm using Elliptic Curve algorithm for security and

performance enhancement, International Journal of Scientific & Technology Research, Volume 1, Issue 4, May 2012.

[5] D. Pugila, H. Chitrala, S. Lunawat, P.M. Durai Raj Vincent, An Efficient Encryption Algorithm Based On Public Key

Cryptography. International Journal of Engineering and Technology, Volume 5 No 3,Jun-2013.

[6] Burt Kaliski, The Mathematics of the RSA Public-key Cryptosystem RSA Laboratory.

[7] Fatema Chowdhury, Munibur Rahman Chowdhury, Essentials of Number Theory,Pi Publications,Dhaka Bangladesh.2005

[8] B.A. Forouzan, Cryptography & Network Security, Tata Mcgraw Hill publishing company limited, 2010.

[9] T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithm, 2nd edition, MIT press,2002.

[10] A.S. Tanenbaum, Computer Networks, 4th edition, Prentice Hall of India, 2007-2008.

[11]

B.R. Ambedkar, S.S. Bedi, A New Factorization Method to Factorize RSA Public Key Encryption, International Journal of

Computer Science Issues, Vol. 8, Issue 6, No 1, November 2011.

www.ajer.org

Page 149

- Online Banking Security LevelUploaded byfarahfaroro
- New Trends in CryptographyUploaded byShiv Saroj
- IRJET- A Two Symmetric Keys Technique to Encrypt/Decrypt Digital Colored Image to Minimize LossUploaded byIRJET Journal
- CNS - QB - 2 & 16Uploaded byBrinda BM
- Ron Was Wrong, Whit is RightUploaded byKemal Yaylali
- 30Uploaded byananditnet
- 8.Dbms SecurityUploaded byHoàng Đình Hạnh
- ch07Uploaded byfdsafdsab
- Hybrid Encryption Technique Using RSA with SHA-1 Algorithm in Data-At-Rest and Data-In-Motion LevelUploaded byijcsis
- CCNA Security OverviewUploaded bycatforddave
- h 0315056Uploaded byAJER JOURNAL
- Chapter 3 Review QuestionsUploaded byJason Reed
- Analization and Comparison of Selective Encryption Algorithms with Full Encryption for Wireless NetworksUploaded byseventhsensegroup
- Concept of Digital SignatureUploaded byHemant Bhagat
- UntitledUploaded byLavanya Menon
- Requirements Model.rtfUploaded bypraveen555
- Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks(2015)Uploaded bySurendra Naik
- ANALYSIS OF SECURITY REQUIREMENTS OF FUTURISTIC MOBILE APPLICATIONSUploaded byMandy Diaz
- A Threshold Cryptosystem Without Trusted Party-pedersenUploaded byDocsa Nshm
- 5.[29-38]a Practical Approach for Implementation of Public Key Infrastructure for Digital SignaturesUploaded byiiste
- Telecommunications – GlossaryUploaded byMunir Hossain Auntu
- Achieving Secure, Scalable, And Fine-Grained Data Access Control in Cloud ComputingUploaded byJACK009#
- Introduction to CryptographyUploaded byworming
- ABE SecurityUploaded byjoseph
- Digital SignaturesUploaded byRahul Mathew
- Crypto IntroUploaded byavi0341
- A Comprehensive Survey on Performance Analysis of Chaotic Colour Image Encryption Algorithms Based on Its Cryptographic RequirementsUploaded byijitcajournal
- Assignment 4Uploaded byRoss Chan
- Basic Methods of CryptographyUploaded byedutakeo
- Chapter 7 Review QuestionsUploaded byRobel Fissha

- Weighted Denoising With Multi-Spectral Decomposition for Image CompressionUploaded byAJER JOURNAL
- Minimizing Household Electricity Theft in Nigeria Using GSM Based Prepaid MeterUploaded byAJER JOURNAL
- Experimental Evaluation of Aerodynamics Characteristics of a Baseline AirfoilUploaded byAJER JOURNAL
- Production and Comparartive Study of Pellets from Maize Cobs and Groundnut Shell as Fuels for Domestic Use.Uploaded byAJER JOURNAL
- Experimental Investigation on the Effects of Digester Size on Biogas Production from Cow DungUploaded byAJER JOURNAL
- Improved RSA cryptosystem based on the study of number theory and public key cryptosystemsUploaded byAJER JOURNAL
- Recycling of Scrapped Mating Rings of Mechanical Face SealsUploaded byAJER JOURNAL
- An Evaluation of Skilled Labour shortage in selected construction firms in Edo state, NigeriaUploaded byAJER JOURNAL
- Switching Of Security Lighting System Using Gsm.Uploaded byAJER JOURNAL
- A Concept of Input-Output oriented Super-efficiency in Decision Making Units.Uploaded byAJER JOURNAL
- Pixel Based Off-line Signature Verification SystemUploaded byAJER JOURNAL
- The differentiation between the turbulence and two-phase models to characterize a Diesel spray at high injection pressureUploaded byAJER JOURNAL
- Comparative Analysis of Cell Phone Sound insulation and Its Effects on Ear SystemUploaded byAJER JOURNAL
- Performance Analysis of LTE in Rich Multipath Environments Considering the Combined Effect of Different Download Scheduling Schemes and Transmission ModesUploaded byAJER JOURNAL
- Structure and Surface Characterization of Nanostructured Tio2 Coatings Deposited Via HVOF Thermal Spray ProcessesUploaded byAJER JOURNAL
- Theoretical and experimental study of cavitation dispersing in “liquid-solid” system for revelation of optimum influence modesUploaded byAJER JOURNAL
- The Design and Implementation of a Workshop Reservation SystemUploaded byAJER JOURNAL
- Risk Assessment and Risk MappingUploaded byAJER JOURNAL
- Head Determination and Pump Selection For A Water Treatment Plant In Villages Around Maiduguri, Borno State, NigeriaUploaded byAJER JOURNAL
- Eye State Detection Using Image Processing TechniqueUploaded byAJER JOURNAL
- Unmanned Aerial Vehicle and Geospatial Technology Pushing the Limits of DevelopmentUploaded byAJER JOURNAL
- DMP Packet Scheduling For Wireless Sensor NetworkUploaded byAJER JOURNAL
- WHY JESUS CHRIST CAME INTO THE WORLD?... (A New theory on "TIE MINISTRY")Uploaded byAJER JOURNAL
- An Exponent-Based Propagation Path Loss Model for Wireless System Networks at Vehicular SpeedUploaded byAJER JOURNAL
- Urbanization and the Risk of Flooding In the Congo; Case of The City Of BrazzavilleUploaded byAJER JOURNAL
- Statistical Method of Estimating Nigerian Hydrocarbon ReservesUploaded byAJER JOURNAL
- Utilization of "Marble Slurry" In Cement Concrete Replacing Fine AgreegateUploaded byAJER JOURNAL
- Frequency Selective Fading in Wireless Communication using Genetic AlgorithmUploaded byAJER JOURNAL
- The Role of Citizen Participant in Urban Management (Case Study: Aligudarz City)Uploaded byAJER JOURNAL
- Distinct Revocable Data Hiding In Ciphered ImageUploaded byAJER JOURNAL

- Accountant Resume Sample 2.DocUploaded by2009tamer6138
- Rise WV Case Management Update - June 22Uploaded byAnna Taylor
- Pistol, Semiautomatic, 9mm, m9Uploaded byarmy3005
- Environmental Impact Assessment of Landless Livestock Production SystemUploaded byWellfro
- Circumpolar Adaptation, Social Change, and the Development of Autoimmune Thyroid Disorders Among the Yakut (Sakha) of SiberiaUploaded byCromiron
- Ideamart Newsletter 2014Uploaded byMohamed MY
- A Mobile Operating SystemUploaded byParesh Jaisinghani
- PIONA Analysis of Kerosene by Comprehensive Two-dimensional Gas Chromatography Coupled to Time of Flight Mass SpectrometryUploaded byDurvel de la Cruz
- tps2549-q1.pdfUploaded byAlexandre Ribeiro
- SWOT analysis of novartis pharmaUploaded byMirza_Abbas
- BM235-Manual-EEVblog.pdfUploaded byRavenSpy
- The Return of the AestheticUploaded byJoon Park
- Crederity Brochure - The art of hiring the right peopleUploaded byCrederity
- Ethiopia CaseUploaded byJordan
- Cisco Campus network 1.0 Design GuideUploaded byAshmar Kalangottil
- Andhra Pradesh Budget Analysis 2018-19Uploaded byprasad gujjula
- SWECs Minimum Technical Requirements as at 10042012Uploaded byrieza_f
- Turbocharger Matching.pdfUploaded byGomathi Sankar
- ChangesUploaded byJon Hughes
- Mark]Uploaded byimoon63
- Industrial Applications of MicroemulsionsUploaded byForon
- Food and Beverage CourseUploaded bytomzayco
- kente cloth lesson planUploaded byapi-263998250
- Light Absorption Clinical Chemistry.pdfUploaded byHaco Chinedu Obasi
- Ravi project.docxUploaded byKiran Purohit
- CV-MegaUploaded byAmita Shindu Kusuma
- CDP-Water Sewerage ChargesUploaded byAdrishya
- Linear Sweep and Cyclic Voltametry_ the Principles — Department of Chemical Engineering and BiotechnologyUploaded byDhanika Senaviratne
- maelezoUploaded byFlorian Ananias Byarugaba
- RRC Schedule Jan2016Uploaded byKyler Greenway