Skip to main content
Article
An Elliptic Curve Cryptography approach for Digital Signature in PDA devices
International Journal of Computer Science and Information Technologies (2013)
  • Mahendra Singh yadav
  • Mahendra Kumar Rai
Abstract
The problem undertaken for this paper is “An Elliptic Curve Cryptography approach for Digital Signature in PDA devices”. Digital transaction have become common place and in some cases inextricably linked to modern life. This technological dependency requires that information be unaltered and confidential. So in this paper, problem is to search a good secure technique, which ensures the confidentiality and privacy of message. Cryptography is one efficient way to ensure that if sent message fall into wrong hands, they cannot read it. It is the art of secret writing. Digital signature allows the verification of the ‘origin’ of messages. We use the concept of RSA (by Rivest, Shamir and Adleman) and Elliptic curve Algorithm to implement Digital Signature. Our problem is to find equation of polynomial such that it is too complex to design its elliptic curve. An elliptic-curve group for cryptography comes from the multiples of a generating point ‘G’ a two dimensional point on an elliptic curve over a finite field. In practice, the finite fields used are either integers modulo large primes, or a similar construction using 0/1 polynomials.
Keywords
  • Elliptic Curve Cryptography
Publication Date
November, 2013
Publisher Statement
References

Prof.Vivek Katiyar,A Survey on Elliptic Curve Cryptography for Pervasive Computing Environment, International Journal of Computer Applications (0975 – 8887) Volume 11– No.10, December 2010

Prof.Tarun Narayan Shankar, CRYPTOGRAPHY WITH ELLIPTIC CURVES, International Journal Of Computer Science And Applications Vol. 2, No. 1, April / May 2009

Prof. Dr. Ersan AKYILDIZ “SCALAR MULTIPLICATION ON ELLIPTIC CURVES” M.Sc., Department of Cryptography YAYLA Supervisor: August 2006.

Don Johnson et al Alfred Menezes and Scott Vanstone “ECC, Future Resiliency and High Security Systems” March 30, 1999 ,Dept. of Combinatorics & Optimization, University of Waterloo,Canada ,mail to:- djohnson@certicom.com

Frankfurt “CrypTool Script Mathematics and Cryptography” The author, 1998-2003 July 17, 2003

Robert Zuccherato “ Elliptic Curve Cryptography Support in Entrust “Author: Date: May 9, 2000

Singh, Kirat Pal, and Dilip Kumar. "Performance Evaluation of Low Power MIPS Crypto Processor based on Cryptography Algorithms." arXiv preprint arXiv:1306.1916 (2013).

CZESŁAW KO´S CIELNY “A NEW APPROACH TO THE ELGAMAL ENCRYPTION SCHEME” Academy of Management of Legnica, Faculty of Computer Science , Reymonta 21, 59–220 Legnica, Poland e-mail: C.Koscielny@wsm.edu.pl

Don B. Johnson, Certicom “ECC A Future High Security Systems” Revised July 6 , 1999 to correct typo in RSA key generation description and clarify low exponent RSA discussion , e-mail :-djohnson@certicom.com

Nicholas Jansma and Brandon Arrendondo “Performance Comparison of Elliptic Curve and RSA for Digital Signatures” April 28 2004, njansma@engin.umich.edu, barrendo@engin.umich.edu

Christian P¨uhringer cip “High Speed Elliptic Curve Cryptography Processor for GF(p)” 8.7.2005, e-mail: cip@gmx.at

Sharat Narayan “New Generation Cryptosystems using Elliptic Curve Cryptography”

Aleksandar Juri & Alfred J. Menezesy “Elliptic Curves and Cryptography”March 23, 2005, Journal of Cryptology, 3 (1991), 63-79.

Victor Miller [l2] and Neal Koblitz “ Elliptic curve cryptography” Hewlett-Packard Laboratories, Palo Alto, CA 94304, U.S.A., 1999, Metsovo, Greece, June 27 - July 1

Singh, Kirat Pal, and Shivani Parmar. "Design of High Performance MIPS Cryptography Processor Based on T-DES Algorithm." International Journal of Engineering Research and Technology. Vol. 1. No. 3 (May-2012). ESRSA Publications, 2012.

V. S. Dimitrov et al L. Imbert and P. K. Mishra “Fast Elliptic Curve Point Multiplication using Double-Base Chains” University of Calgary, University drive NW Calgary, AB, T2N 1N4, Canada 2 CNRS, LIRMM, UMR 5506 ,161 rue Ada, 34392 Montpellier cedex 5, France.

M. Abdalla, M. Bellare, and P. Rogaway. DHAES: “Elliptic Curve Cryptography” Certicom Research. 1998. secg-talk@lists.certicom.com,http://www-cse.ucsd.edu/users/mihir/

IEEE P1363. Standard Specifications for Public-Key Cryptography. Institute of Electrical and Electronics Engineers, 2000.

Dr. Andreas Steffen “The Elliptic Curve Cryptosystem” in the year of 2002, Zürcher Hochschule Winterthur

IEEE P1363A. Standard Specifications for Public-Key Cryptography: Additional Techniques. May,2000. Working Draft.

ISO/IEC 14888-3. Information technology - Security techniques - Digital signatures with appendix- Part 3: Certificate-based mechanisms.

ISO/IEC 15946-1. Information technology - Security techniques - Cryptographic techniques based on elliptic curves - Part 1: General. 1998. Working draft.

ANSI X9.63-199x: Public Key Cryptography for the Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography. October, 1999. Working Draft.

ISO/IEC 15946-2. Information technology - Security techniques - Cryptographic techniques based on elliptic curves - Part 2: Digital signatures. 1998. Working draft.

M. Abdalla, M. Bellare, and P. Rogaway. DHAES: An encryption scheme based on the Diffie- Hellman problem. 1998. Full version of [11]. Available from: http://www-cse.ucsd.edu/users/mihir/

T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31: pages 469–472, 1985.

Stallings, W. Cryptography and Network Security. Prentice Hall, 2003.

ANSI X9.62-1998: Public Key Cryptography for the Financial Services Industry: the Elliptic Curve Digital Signature Algorithm (ECDSA). American Bankers association, 1999.

G. Lay and H. Zimmer. Constructing elliptic curves with given group order over large finite fields. Algorithmic Number Theory, pages 250– 263, 1994.

Schneier, B. “Elliptic Curve Public Key Cryptography”. Cryptogram ENewsletter. November 15, 1999 <http://www.counterpane.com/
Citation Information
Mahendra Singh yadav and Mahendra Kumar Rai. "An Elliptic Curve Cryptography approach for Digital Signature in PDA devices" International Journal of Computer Science and Information Technologies (2013)
Available at: http://works.bepress.com/sakshi-sharma/4/
Creative Commons license
Creative Commons License
This work is licensed under a Creative Commons CC_BY-NC International License.