A technique based on the euclidean algorithm and its applications to cryptography and nonlinear diophantine equations

• Cortés Vega, Luis A. ^[1] ; Rojas Castro, Daniza E. ^[1] ; Santiago Ayala, Yolanda S. ^[2] ; Rojas Romero, Santiago C. ^[2]
  1. [1] Universidad de Antofagasta

     Universidad de Antofagasta

     Antofagasta, Chile

     
  2. [2] Universidad Nacional Mayor de San Marcos

     Universidad Nacional Mayor de San Marcos

     Perú

     
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 26, Nº. 3, 2007, págs. 309-339
• Idioma: inglés
• DOI: 10.4067/S0716-09172007000300007
• Enlaces
  • Texto completo
• Resumen

  • The main objective of this work is to build, based on the Euclidean algorithm, a “matrix of algorithms” ΦB : N∗ m×n→ N∗ m×n , with ΦB(A)=(Φbij (aij )), where B = (bij )1≤i≤m1≤j≤n is a fixed matrix on N∗ m×n. The function ΦB is called the algorithmic matrix function. Here we show its properties and some applications to Cryptography and nonlinear Diophantine equations. The case n = m = 1 has particular interest. On this way we show equivalences between ΦB and the Carl Friedrich Gauβ’s congruence module p.

• Referencias bibliográficas
  • Citas [1] R. D, Mauldin, A Generalization of Fermat’s Last Theorem: The Beal’s Conjeture and Prize Problem. Notices of the AMS, 44, No 11,...
  • [2] A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, (1996).
  • [3] C. Mercado, Historia de las Matemáticas, Ed. Universitaria, Santiago de Chile, (1972).
  • [4] S. Lang, Old and new conjetured diophantine inequalities, Bull. Amer. Math. Soc, 23, pp, 37—75, (1990)
  • [5] A. Walis, Modular elliptic curves and Fermat‘s Last Theorem, Ann. Math. 141 (1995), pp. 443—551, (1995).
  • [6] S. Singh, O ´ultimo Teorema de Fermat, Ed. Record, Rio de Janeiro, (1999).
  • [7] N. L. Biggs, Matemática Discreta, Ed. Vicens—Vives, (1994).
  • [8] L. A. Cortés Vega, D. E. Rojas Castro, Y. S. Santiago Ayala and S. C. Rojas Romero, Entre la congruencia de Gauβ y el Algoritmo de Euclides:...
  • [9] L. A. Cortés—Vega, D. E. Rojas—Castro, The Quotient Function and its applications to some problems yielding in Discrete Mathematics and...
  • [10] B. Kolman, R. S. Busby y S. C. Ross, Estructura de matemáticas discretas para la computación, Prentice Hall, (1887).
  • [11] R. Graham, D. E. Knuth y O. Patashnik, Concrete Mathematics: A fondation for Computer Science, Addison-Wesley, (1994).
  • [12] D. Burton, Elementary Number Theory, Ed. Allyn—Bacon, (1980).
  • [13] A. Hodges, Alan Turing: The Enigma of Intelligence, Ed. Unwin— Paperbacks, (1983).
  • [14] R. P. Grimaldi, Discrete and Combinatorial Mathematics. An Applied Introduction, Addison-Wesley, (1994).