Artículos de revistas
A TECHNIQUE BASED ON THE EUCLIDEAN ALGORITHM AND ITS APPLICATIONS TO CRYPTOGRAPHY AND NONLINEAR DIOPHANTINE EQUATIONS
Autor
CORTÉS VEGA,LUIS A.
ROJAS CASTRO,DANIZA E.
SANTIAGO AYALA,YOLANDA S.
ROJAS ROMERO,SANTIAGO C.
Institución
Resumen
The main objective of this work is to build, based on the Euclidean algorithm, a matrix of algorithms <img border=0 width=476 height=41 id="_x0000_i1032" src="../img/formula1.JPG"> Where <img border=0 width=196 height=28 id="_x0000_i1031" src="../img/formula2.JPG">is a fixed matrix on<img border=0 width=68 height=29 id="_x0000_i1030" src="../img/formula3.JPG">The function <img border=0 width=17 height=20 id="_x0000_i1029" src="../img/formula4.JPG">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 <img border=0 width=17 height=20 id="_x0000_i1028" src="../img/formula4.JPG">B and the Carl Friedrich Gauß s congruence module p.