CFP last date
22 April 2024
Reseach Article

A Method for Recovering a Key in the Key Exchange Cryptosystem by Diophantine Equations

by P. Anuradha Kameswari, L. Praveen Kumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 100 - Number 14
Year of Publication: 2014
Authors: P. Anuradha Kameswari, L. Praveen Kumar
10.5120/17592-8302

P. Anuradha Kameswari, L. Praveen Kumar . A Method for Recovering a Key in the Key Exchange Cryptosystem by Diophantine Equations. International Journal of Computer Applications. 100, 14 ( August 2014), 11-13. DOI=10.5120/17592-8302

@article{ 10.5120/17592-8302,
author = { P. Anuradha Kameswari, L. Praveen Kumar },
title = { A Method for Recovering a Key in the Key Exchange Cryptosystem by Diophantine Equations },
journal = { International Journal of Computer Applications },
issue_date = { August 2014 },
volume = { 100 },
number = { 14 },
month = { August },
year = { 2014 },
issn = { 0975-8887 },
pages = { 11-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume100/number14/17592-8302/ },
doi = { 10.5120/17592-8302 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:29:56.971763+05:30
%A P. Anuradha Kameswari
%A L. Praveen Kumar
%T A Method for Recovering a Key in the Key Exchange Cryptosystem by Diophantine Equations
%J International Journal of Computer Applications
%@ 0975-8887
%V 100
%N 14
%P 11-13
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The Diophantine equations define an algebraic curve or an algebraic surface and ask about lattice points on it. A Diophantine equation may either possess no non trivial solution or finite number of solutions or infinite number of solutions. Therefore, computing lattice points is difficult in general for Diophantine equations of order greater than one. This ambiguity regarding the solutions of a Diophantine equation is another source for trapdoor functions in Public key cryptography. In this paper we analyze the potentiality of Diophantine equations in the key exchange cryptosystem and propose a method for recovering a key in the key exchange cryptosystem by Diophantine equations.

References
  1. J. Buchmann "Introduction to cryptography" , Springer-Verlag 2001
  2. D. Burton, "Elementary Number Theory" Sixth ed, Mc Graw Hill, New York, 2007.
  3. H. Davenport's, "The Higher Arithmetic", Eighth edition, Cambridge University Press, ISBN-13 978-1-107-68854-4.
  4. G. H. Hardy, E. M. Wright, D. R. Heath-Brown and J. H. Silverman, "An Introduction to the Theory of Numbers", Oxford University Press, 1965.
  5. Harry Yosh, Heco Ltd, Canberra, Australia "The Key Exchange Cryptosystem Used With Higher Order Diophantine Equations" , IJNSA journal Vol. 3, No 2, March 2011}
  6. Jacobson. M and W. Hugh, "Solving the Pell equation", CMS books in Mathematics, Canadian Mathematical society, 2009.
  7. Neal Koblitz "A course in number theory and cryptography ISBN 3-578071-8,SPIN 10893308 "
  8. Lawrence C. Washington, Wade Trappe "Introduction to Cryptography with Coding Theory" 2nd edition, Pearson.
  9. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone. , "Handbook of Applied Cryptography," CRC Press Series on Discrete Mathematics and its Applications. Boca Raton, FL, 1997.
  10. I. Niven, H. S. Zuckerman, and H. L. Montgomery, "An Introduction to the Theory of Numbers", Fifth edition, John Wiley $&$ Sons, New York, 1991.
  11. K. H. Rosen"Elementary Numbertheory and Its Applications" 3rd ed. , Addison-Wesley,1993
  12. D. R. Stinson, "Cryptography Theory and Practice", Second Edition, Chapman Hall/CRC, 2002.
Index Terms

Computer Science
Information Sciences

Keywords

Key exchange Diophantine equations