CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A New Approach for Secured Transition using Prime Field Elliptic Curve Cryptography System

by Muhammad Firoz Mridha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 28 - Number 4
Year of Publication: 2011
Authors: Muhammad Firoz Mridha
10.5120/3379-4685

Muhammad Firoz Mridha . A New Approach for Secured Transition using Prime Field Elliptic Curve Cryptography System. International Journal of Computer Applications. 28, 4 ( August 2011), 1-5. DOI=10.5120/3379-4685

@article{ 10.5120/3379-4685,
author = { Muhammad Firoz Mridha },
title = { A New Approach for Secured Transition using Prime Field Elliptic Curve Cryptography System },
journal = { International Journal of Computer Applications },
issue_date = { August 2011 },
volume = { 28 },
number = { 4 },
month = { August },
year = { 2011 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume28/number4/3379-4685/ },
doi = { 10.5120/3379-4685 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:13:50.303055+05:30
%A Muhammad Firoz Mridha
%T A New Approach for Secured Transition using Prime Field Elliptic Curve Cryptography System
%J International Journal of Computer Applications
%@ 0975-8887
%V 28
%N 4
%P 1-5
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The demands of secured electronic transactions are increasing rapidly. Prime Field Elliptic curve cryptosystems (PFECC) are becoming most popular because of the reduced number of key bits required in comparison to other cryptosystems. PFECC is emerging as an attractive alternative to traditional public-key cryptosystems. PFECC offers equivalent security with smaller key sizes resulting in faster computations, lower power consumption, as well as memory and bandwidth savings. While these characteristics make PFECC especially appealing for small devices, they can also alleviate the computational burden on secure web servers.

References
  1. Johannes Buchmann, Michael J. Jacobson JR, Edlyn Teske. On Some Computational Problems in Finite Abelian Groups, Mathematics of Computation, Volume 66 Number 220, October 1997, pp. 1663-1687.
  2. Neil Koblitz. Elliptic curve cryptosystems. In Mathematics of Computation, volume 48, pages 203–209, 1987. C356
  3. Victor S. Miller. Use of elliptic curves in cryptography. In Advances in Cryptology—Proceedings of Crypto 85, volume 218 of Lecture Notes in Computer Science, pages 417–426. Springer-Verlag, 1986. C356.
  4. Erik De Win, Serge Mister, Bart Preneel, and Michael Wiener. On the performance of signature schemes based on elliptic curves. In Algorithmic Number Theory: Third International Symposium, ANTS-III, Proceedings, volume 1423 of Lecture Notes in Computer Science, pages 252– 266.Springer-Verlag, 1998. C357.
  5. M. V. Wilkes. Time-Sharing Computer Systems, Elsevier, 1968.
  6. G.Purdy. A High-Security Log-In Procedure, Communications of the ACM, 17:442-445, 1974.
  7. W. Di_e, M.E. Hellman. New Directions in Cryptography, IEEE Transactions on Information Theory, IT-22:644-654, 1976.
  8. P. Ivey, S.Walker, J. Stern, S. Davidson. An ultra-high speed public key encryption processor, Proceedings of IEEE Custom Integrated Circuits Conference, Boston, 19.6.1-19.6.4, 1992.
  9. Alfred Menezes. Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, USA, 1993.
  10. Certicom. An Introduction to Information Security, The First in a Series of ECC Whitepapers, March 1997.
  11. S. Goldwasser, S. Micali. Probabilistic encryption and how to play mental poker keeping secret all partial information, Proceedings of 14th ACM Symposium on Theory of Computing, pp. 365-377.
  12. Neal Koblitz. Algebraic Aspects of Cryptography, Algorithms and Computation in Mathematics, Volume 3, Springer-Verlag, New York, 1998.
  13. Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone. Handbook of Applied Cryptography, CRC Press, USA, 1997.
  14. R.L. Rivest, A. Shamir, L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, 21(2):120- 126, February 1978.
  15. T. Rosati. A high speed data encryption processor for public key cryptography, Proceedings of IEEE Custom Integrated Circuits Conference, San Diego, 12.3.1 - 12.3.5, 1989.
Index Terms

Computer Science
Information Sciences

Keywords

Prime Field Elliptic curve cryptosystems public key cryptosystems RSA Modular Arithmetic Key Distribution center.

Powered by PhDFocusTM