Multipair Public Key Cryptosystem

Multipair Public Key Cryptosystem

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2014 by IJETT Journal
Volume-11 Number-3                          
Year of Publication : 2014
Authors : M. Sreedevi , Prof. M. Padmavathamma
  10.14445/22315381/IJETT-V11P227

Citation 

M. Sreedevi , Prof. M. Padmavathamma. "Multipair Public Key Cryptosystem", International Journal of Engineering Trends and Technology (IJETT), V11(3),140-145 May 2014. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract

Cryptography mainly deals with security provided to the data access the network. Asymmetric key cryptography, also called as Public Key cryptography, uses two different keys (which forms a key pair),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. Many cryptosystems has been proposed with modifications to original RSA by improving security, performance of various phases of algorithm. this paper we propose multiple public keys to provide hierarchy implementation of encryption and decryption phases when compare to RSA Batch-RSA, Multi- Prime RSA, Rebalanced – RSA – Analysis.

References

[1] Dan Boneh. “Fast variants of RSA”
[2] Behrouz A. Forouzan,?Data Communications and Networking?, Tata McGraw Hill Education Private Limited, 4th Edition.
[3] Cesar Alison MonteiroPaix~ao?. ?An efficient variant of the RSA cryptosystem
[4]Hung-Min Sun, Mu-En Wu, Wei-Chi Ting, and M. Jason Hinek. ? Dual RSA and Its Security Analysis?
[5] Dan Boneh. “Twenty Years of Attacks on the RSA Cryptosystem
[6] Satyendra NathMandal ,Kumarjit Banerjee Modified Trail division for Implementation of RSA Algorithm with Large Integers?.
[7] D. Chaum, ?Untraceable electronic mail, return address and digital pseudonyms,? Commun. ACM, vol. 24, no. 2, pp. 84–88, Feb. 1981.
[8] Sun H.-M. and C.-T. Yang, ?RSA with balanced short exponents and its application to entity authentication in Public Key Cryptology?, Springer, NewYork, 2005, pp. 199–215.
[9] Sun H.-M. and Wu M.-E., ?An approach towards Rebalanced RSA-CRT with short public exponent Cryptology?.
[10] Anand Krishnamutrhy and et.al ?an efficient implementation of multi-prime rsa on dsp processor?
[11] Enterprise Solutions ?Cryptography using Compaq MultiPrime technology in parallel processing environment?.
[12] M. Wiener. ?Cryptanalysis of Short RSA Secret Exponents.? IEEE Trans. Information Theory 36(3):553–558. May 1990.
[13] Stallings William, ?Cryptography and Network Security - Principles and Practices? India : Pearson Prentice Hall, 4th Edition.
[14] A. Fiat. ?Batch RSA.? In G. Brassard, ed., Proceedings of Crypto 1989, vol. 435 of LNCS, pp. 175–185. Springer-Verlag, Aug. 1989.
[15] Dictionary of terms, Help Desk for Digital Ids, Soltrus Inc., Available: www.soltrus.com/english/digitalidhelpcentre/digitalid_about_dictionary.html.
[16]wordiQ.com, “History of cryptography,” Available: http://www.wordiq.com/definition/History _of_cryptography.
[17]A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of applied cryptography, CRC press, 1996.
[18] Suresh K,Venkataramana.K, “Study of Analysis on RSA and its Variants“,International Journal of Computer Science Research & Technology (IJCSR),Vol. 1 Issue 4, September - 2013

Keywords
Cryptography, RSA, Batch-RSA, Multi- Prime RSA, Rebalanced – RSA – Analysis.