An Elliptic Curve Cryptography approach for Digital Signature in PDA devicesInternational Journal of Computer Science and Information Technologies (2013)
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.
- Elliptic Curve Cryptography
Publication DateNovember, 2013
Citation InformationMahendra 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
This work is licensed under a Creative Commons CC_BY-NC International License.