The week's pick
Random Articles
Reseach Article
Implementation of GCD Attack with Projective Coordinates on Demytko’s Cryptosystem
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 124 - Number 6 |
| Year of Publication: 2015 |
| Authors: P. Anuradha Kameswari, L. Praveen Kumar |
10.5120/ijca2015905513
|
P. Anuradha Kameswari, L. Praveen Kumar . Implementation of GCD Attack with Projective Coordinates on Demytko’s Cryptosystem. International Journal of Computer Applications. 124, 6 ( August 2015), 33-40. DOI=10.5120/ijca2015905513
Abstract
GCD attack depends on modifying the cipher text and then get an access to the decryption of the modified cipher text that is discarded identifying as due to bad implementation. In this paper we mount a GCD attack on Demytko’s cryptosystem on elliptic curves. In this we implement the attack by point addition with projective coordinates using a fast computation method. As this involves working only with x-coordinates. We start with developing the formulas for the projective coordinates x : z generalizing the ideas of Montgomery and propose to use these formulas to generate the polynomials for the GCD attack.
References
- R. Balasubramanian “Elliptic Curves and Cryptography" proceedings of the advanced instructional workshop on Algebraic number theory, HBA (2003)325-345
- I.F.Blake, G. Seroussi and N. P. Smart “Elliptic Curves in Cryptography", volume 265 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 2000.
- J. Buchmann“Introduction to cryptography" , Springer-Verlag 2001.
- N. Demytko “ A new elliptic curve based analogue of RSA". In T. Helleseth, editor Advances in Cryptology - EUROCRYPTO 93, Volume 765 of Lecture notes in Computer Science, 40-49, Springer-Verlag, 1994.
- Jeffery Hoftstein, Jill Pipher, Joseph H. Silverman, “ An Introduction to Mathematical Cryptography", Springer.
- D. Husemoller. Elliptic Curves, 2nd edition, volume 111 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2004. With appendices by O. Forster, R. Lawrence, and S. Theisen.
- Marc Joye and Jean - Jacques Quisquater, “ On the importance of securing your bins: The garbage-man-in-the-middle attack”, ACM Press, 1997.
- K. Koyama, U.M. Maurer, T. Okamoto and S.A. Vanstone “ New public-key Schemes based on elliptic curves over the ring ". In J. Feigenbaum, editor Advances in Cryptology - CRYPTO 91, Volume 576 of Lecture notes in Computer Science, 252-266, Springer-Verlag, 1991.
- V.S. Miller “ Use of Elliptic Curves in Cryptography". In H.C. Williams, editor Advances in Cryptology - CRYPTO 85, Volume 218 of Lecture notes in Computer Science, 417-426, Springer-Verlag, 1986.
- Neal Koblitz “ Algebraic Aspects of Cryptography", volume 3 of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin, 1998.
- Neal Koblitz “ Elliptic Curve Cryptosystems" Mathematics of Computation, 48: 203-209, 1987.
- Neal Koblitz “A course in number theory and cryptography ISBN 3-578071-8,SPIN 10893308 "
- H.W. Lenstra, JR. Elliptic Curves and Number-Theoretic Algorithms .Proceedings of the International Congress of Mathematicians, Berkeley, California, USA, 1986.
- J. H. Silverman. The Arithmetic of Elliptic Curves, volume 106 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1986.
- J. H. Silverman. Elliptic curves and cryptography. In Public-Key Cryptography, volume 62 of Proc. Sympos. Appl. Math., pages 91-112. Amer. Math. Soc., Providence, RI, 2005.
- J. H. Silverman and J. Tate. Rational Points on Elliptic Curves. Undergraduate Texts in Mathematics. Springer-Verlag, New York, 1992.
- Lawrence C. Washington “Elliptic Curves Number Theory and Cryptography" 2nd edition, CRC press.
- Lawrence C. Washington, Wade Trappe “Introduction to Cryptography with Coding Theory" 2nd edition, Pearson.
Index Terms
Keywords