We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Study of Finite Field over Elliptic Curve: Arithmetic Means

by Samta Gajbhiye, Sanjeev Karmakar, Monisha Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 47 - Number 17
Year of Publication: 2012
Authors: Samta Gajbhiye, Sanjeev Karmakar, Monisha Sharma
10.5120/7283-0411

Samta Gajbhiye, Sanjeev Karmakar, Monisha Sharma . Study of Finite Field over Elliptic Curve: Arithmetic Means. International Journal of Computer Applications. 47, 17 ( June 2012), 32-38. DOI=10.5120/7283-0411

@article{ 10.5120/7283-0411,
author = { Samta Gajbhiye, Sanjeev Karmakar, Monisha Sharma },
title = { Study of Finite Field over Elliptic Curve: Arithmetic Means },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 47 },
number = { 17 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 32-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume47/number17/7283-0411/ },
doi = { 10.5120/7283-0411 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:42:08.412679+05:30
%A Samta Gajbhiye
%A Sanjeev Karmakar
%A Monisha Sharma
%T Study of Finite Field over Elliptic Curve: Arithmetic Means
%J International Journal of Computer Applications
%@ 0975-8887
%V 47
%N 17
%P 32-38
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Public key cryptography systems are based on sound mathematical foundations that are designed to make the problem hard for an intruder to break into the system. Number theory and algebraic geometry, namely the theory of elliptic curves defined over finite fields, has found applications in cryptology. The basic reason for this is that elliptic curves over finite fields provide an inexhaustible supply of finite abelian groups which, even when large, are amenable to computation because of their rich structure. The first level is the mathematical background concerning the needed tools from algebraic geometry and arithmetic. This paper introduces the elementary algebraic structures and the basic facts on number theory in finite fields. It includes the minimal amount of mathematical background necessary to understand the applications to cryptology. Elliptic curves are intimately connected with the theory of modular forms, in more than one ways. The paper gives a brief introduction to modular arithmetic, which is the core arithmetic of almost all public key algorithms. . The ultimate goal of the paper is to completely understand the structure of the points on the elliptic curve over any field F and being able to find them.

References
  1. Murphy T, "Course 373-Finite Fields" , University of Dublin, Trinity College School of Mathematicshttp://www. maths. tcd. ie/pub/Maths/ Courseware /FiniteFields/FiniteFields. pdf, 2006.
  2. Schneier, Bruce, "Applied Cryptography: Protocols, Algorithms and Source Code in C" , John-Wiley and Sons, New York, 1994. ISBN: 0-471-5975602, 1994.
  3. Stinson, Douglas R, "Cryptography: Theory and Practice" , CRC Press, Boca Raton, Florida, 1995, ISBN: 0-8493-8521-0, 1995.
  4. Certicom : "ECC Tutorial" , http://www. certicom. com/index. php?action=ecc,ecc_tutorial , 2006.
  5. Goldreich, Oded , " Foundations of Cryptography" , Cambridge University Press, Cambridge 2001, ISBN 0-521-79172-3, 2001.
  6. Mollin, Richard , "Introduction to Cryptography", Chapman & Hall/CRC, Boca Raton, 2000, ISBN" 1-58488-127-5, 2005.
  7. Welsh, Dominic ,"Codes and Cryptography", Oxford University Press, Oxford. 1990, ISBN 0-19-853287-3, 1990
  8. Balasubramanian, R. , "Elliptic Curves and Cryptography", in Bhandari A. K. , Nagraj D. S. , Ramakrishnan, B. , Venkataraman T. N. , (editors), Elliptic Curves, Modular Forms, and Cryptography, Hindustan Book Agency, New Delhi, 2003. ISBN 81-85931-42-9, pp 325-345, 2003.
  9. N. Koblitz, "A Course in Number Theory and Cryptography" , 2nd edition, Springer-Verlag, 1994.
  10. R. McEliece, "Finite Fields for Computer Scientists and Engineers" , Kluwer Academic Publishers, Boston,1987.
  11. R. Lidl and H. Niederreitter, "Introduction to Finite Fields and their Applications", Cambridge UniversityPress , 1984
  12. A. Menezes, "Elliptic Curve Public Key Cryptosystems", Kluwer Academic Publishers, Boston , 1993
  13. I. Blake, G. Seroussi and N. Smart, "Elliptic Curves in Cryptography" , Cambridge University Press, 1999.
  14. A. Enge, "Elliptic Curves and Their Applications to Cryptography—An Introduction" , Kluwer Academic Publishers, 1999.
  15. J. Silverman, "The Arithmetic of Elliptic Curves" , Springer-Verlag, 1986.
  16. Certicom, Standards for Efficient Cryptography, "SEC 1: Elliptic Curve Cryptography" , Version 1. 0, September 2000, Available at http://www. secg. org /download/aid385/sec1_final. pdf
  17. Certicom, Standards for Efficient Cryptography, "SEC 2: Recommended Elliptic Curve Domain Parameters" , Version 1. 0, September 2000, Available at http://www. secg. org/download/aid-386/sec2_final. pdf
  18. Darrel Hankerson, Julio Lopez Hernandez, Alfred Menezes, "Software Implementation of Elliptic Curve Cryptography over Binary Fields" , 2000, Available at http://citeseer. ist. psu. edu/hankerson00software. html
  19. http://www. certicom. com/index. php/41-an-example-of-an- elliptic-curve-group-over-f2m
  20. Michal Sramka, Otokar Grosek, " Efficiency of the Elliptic Curve Cryptosystems", AMS Subject Classification: 11T71, 11G07, work was supported by VEGA grant 1/7611/20.
  21. COHEN, H. , - Miyaji, A. ,- Ono, T, " Efficient Elliptic Curve Exponentiation Using Mixed Coordinates", Advances in Cryptology – ASIACRYPT 98, LNCS 1514, Springer-Verlag, (1998), pp. 51-65.
  22. W. WATERHOUSE. , "Abelian varieties over finite fields. Annales Scientifiques" , de l'E´cole Normale Superieure, 4e Serie, 2:521–560, 1969.
  23. Darell Hankerson, Alfred Menezees and Scott Vanston, " Guide to Elliptic Curve Cryptography" Springer- Verlag, New York, Inc. 2004
  24. Dipti Aglawe , Samta Gajbhiye , "Software Implementation of Cyclic Abelian Elliptic Curve using Matlab", International Journal of Computer Applications (0975 – 8887) Vol 42(6), p: 43-48 March 2012
Index Terms

Computer Science
Information Sciences

Keywords

Abelian Group Cyclic Group Binary Field Prime Field Elliptic Curve

Powered by PhDFocusTM