CFP last date
01 January 2025
Reseach Article

Pragmatic Implementation of RSA-1024 Cryptography

by Sanjeev Karmakar, Siddhartha Choubey
Communications on Applied Electronics
Foundation of Computer Science (FCS), NY, USA
Volume 3 - Number 1
Year of Publication: 2015
Authors: Sanjeev Karmakar, Siddhartha Choubey
10.5120/cae2015651846

Sanjeev Karmakar, Siddhartha Choubey . Pragmatic Implementation of RSA-1024 Cryptography. Communications on Applied Electronics. 3, 1 ( October 2015), 19-27. DOI=10.5120/cae2015651846

@article{ 10.5120/cae2015651846,
author = { Sanjeev Karmakar, Siddhartha Choubey },
title = { Pragmatic Implementation of RSA-1024 Cryptography },
journal = { Communications on Applied Electronics },
issue_date = { October 2015 },
volume = { 3 },
number = { 1 },
month = { October },
year = { 2015 },
issn = { 2394-4714 },
pages = { 19-27 },
numpages = {9},
url = { https://www.caeaccess.org/archives/volume3/number1/432-2015651846/ },
doi = { 10.5120/cae2015651846 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-09-04T19:43:16.667735+05:30
%A Sanjeev Karmakar
%A Siddhartha Choubey
%T Pragmatic Implementation of RSA-1024 Cryptography
%J Communications on Applied Electronics
%@ 2394-4714
%V 3
%N 1
%P 19-27
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Contemporary RSA-1024 system is used in the current world’s computer networks for secure communication and transmission. The RSA -1024 system is absolutely secure from the intruders. However it required huge computational effort during encryption and decryption. This can be solved by the fast exponential method however again required mathematical space and time complexity. Java mathematical tool provides BigInteger APIs are significantly suitable to solve this complexity problem. In this paper RSA public key (e, n) and provate key (d, n) used as 1024 bits long large prime product. The encryption and decryption is accomplished through the methods of BigInteger class. In this paper, pragmatic RSA-2048 cryptosystem is presented for e-mail service. The entire design, implantation and deployment is presented in this paper.

References
  1. Kahn, D., 1967. The Codebreakers, Macmillan Co., New York..
  2. Johannes, A., Buchmann, 2000. Introduction To Cryptography, Springer-Verlog, Berlin, pp. 45-50, New York 2000.
  3. Rivest, R.L., 1990. Cryptography, Handbook of Theoretical Computer Science, volume A (editor: J. van Leeuwen), MIT Press/Elsevier, Amsterdam, pp.719-755.
  4. Brassard, G., 1988. Modern Cryptology, Springer-Verlag.
  5. Brassard, G., 1993. Cryptography column - Quantum cryptography: A bibliography, Sigact News (3) 24 (1993), pp.16-20.
  6. Stinson, D.R., 1995. Cryptography - Theory and Practice, CRC Press, Boca Raton.
  7. Stallings, W., 1995: Network and Internetwork Security - Principles and Practice, Prentice-Hall, New Jersey.
  8. Simmons, G.J., 1992. Contemporary Cryptology - The Science of Information Integrity, IEEE Press.
  9. Schneier, B.,1995. Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd Edition, Wiley.
  10. Ford, W., 1994. Computer Communications Security Principles, Standard Protocols and Techniques, Prentice-Hall, New Jersey.
  11. Rivest, R.L., Shamir, A., Adleman, L.M., 1978. A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM (2) 21, pp.120-126.
  12. RSA Laboratories, The RSA Factoring Challenge. Retrieved on 2008-03-10.
  13. RSA Laboratories, The RSA Factoring Challenge FAQ. Retrieved on 2008-03-10
Index Terms

Computer Science
Information Sciences

Keywords

RSA RMI Cryptography Encryption Decryption Network Security RSA-1024 NFS ECM