i-manager Publications

Asymmetric Based Algorithm Using LC - PRNG as Basic Primes for Security Corroboration

D.Kowsalya*, G.Jothilakshmi**, N. Karthikeyan***

*-** UG Students, Department of ECE, University College of Engineering, Ramanathapuram.

*** Assistant Professor, Department of ECE, University College of Engineering, Ramanathapuram.

Periodicity:June - August'2013
DOI : https://doi.org/10.26634/jcom.1.2.2450

Abstract

With the explosion of networks and huge amount of data transmitted along, securing data content is becoming more and more important. The protection afforded to an automated information system is to attain the applicable objectives of preserving the integrity, accountability, authenticity and non repudiation. Many cryptographic Symmetric and Asymmetric algorithms are proposed. But symmetric key have some weakness such as suffering Brute Force, desynchronization etc.To get rid of from the weakness and reduce the system workload, we adopt Rivest Shamir Adleman (RSA) to construct an asymmetric key [2].Among the asymmetric algorithms the most widely accepted and implemented approach is the RSA encryption. Pseudo Random Numbers (PRN) are used in a number of areas such as Cryptography, Scientific Statistical Simulation etc. In cryptography the pseudo random number is a crucial element in the secret keys for cryptography algorithms and protocols. In this paper we have introduced new concept of RSA algorithm which is based on PN (Prime Numbers). These PN are selected from PRN sequence. The PN are used as input to RSA (Rivest Shamir Adleman) algorithm [3]. This technique is implemented by MATLAB

Keywords

RSA, PRNG, PRN, PR, LCG, BBSG, PN, AES.

How to Cite this Article?

Kowsalya, D., Jothilakshmi, G., and Karthikeyan,N. (2013). Asymmetric Based Algorithm Using LC - PRNG As Basic Primes For Security Corroboration. i-manager’s Journal on Computer Science, 1(2), 29-34. https://doi.org/10.26634/jcom.1.2.2450

References

[1]. Bruce Schneie. (1996). Applied Cryptography – Protocols, Algorithms and Source Code in C, Second Edition, John Wiley and Sons, New York.

[2]. Burnett .S,. and Paine S. McGraw-Hill. (2001). “RSA Security's Official Guide to Cryptography”.

[3]. Ching Chao Yang. (1998). “A new RSA cryptosystem hardware design based on Montgomery's algorithm”, pp- 908-913, IEEE.

[4]. Hang Qing. (2011). “The large prime numbers based on genetic algorithm”, (ICISIE) pp-434-437, IEEE.

[5]. Haldir. (2004). “The Reverse Engineering Team, How to crack a Linear Congruential Generator”, December .Available online at http://www.reteam.org/papers/ e59.pdf.

[6]. Hinek. M. (2010). “Cryptanalysis of RSA and Its Variants”.

[7]. M. K. Khan and J. S. Zhang. (2006). “Investigation on pseudorandom properties of chaotic stream cipher”, Proc. IEEE International Conference on Engineering of Intelligent Systems, pp. 1-5.

[8]. Kumar. R. (2010). “An advanced secure (t, n) threshold proxy signature scheme based on RSA cryptosystem for known signers”, pp 293-298, IEEE.

[9]. Mustak E. Yalcin, Johan A. K. Suykens and JoosVandewalle. (2004). "True Random Bit Generation From a Double-Scroll Attractor", IEEE Transactions on Circuits and Systems, Vol. 51, No.7, July pp 1395-1404.

[10]. Park Stephen K. and Keith W. Miller, (1988). "Random Number Generators: Good ones are hard to find", Communications of the ACM, October1988, pp.1 192- 201.

[11]. Ren-Junn, H. Wang, (2005). “An efficient decryption method for RSA cryptosystem”, pp-585-590, IEEE.

[12]. N. Ruggeri, (2006). “Principles of Pseudo-Random Number Generation in Cryptography, VIGRE Program”, A u g u s t . A v a i l a b l e o n l i n e a t h t t p : / / w w w. m a t h . u c h i c a g o . e d u / ~ m a y / V I G R E / VIGRE2006/PAPERS/Ruggeri.pdf

[13]. Sonal Sharma, (2011). RSA algorithm using modified s u b s e t s u m c r y p t o s y s t e m , “ C o m p u t e r a n d Communication Technology” (ICCCT), pp-457-461, IEEE.

[14]. International Cryptology Conference (CRYPTO). Lecture Notes in Computer Science, Vol. 3152, Santa Barbara, CA, Aug. 2004, pp. 123–139.

[15]. National Institute of Standards and Technology (NIST). Secure Hash Standard, FIPS PUB 180-1, www.itl.nist.gov/fipspubs/fip180-1.htm.

If you have access to this article please login to view the article or kindly login to purchase the article

Single Article

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Online	15	15

ADD TO CART

Options for accessing this content:

If you would like institutional access to this content, please recommend the title to your librarian.
If you already have i-manager's user account: Login above and proceed to purchase the article.
New Users: Please register, then proceed to purchase the article.