Skip to main navigation menu Skip to main content Skip to site footer

Expanding graphs in cryptography

GRAFOS EXPANSORES EN CRIPTOGRAFÍA




Section
Artículos

How to Cite
[1]
D. A. GARCÍA, “Expanding graphs in cryptography”, Rev. Ing. Mat. Cienc. Inf, vol. 5, no. 10, pp. 39–48, Jan. 2019, Accessed: Oct. 25, 2024. [Online]. Available: https://ojs.urepublicana.edu.co/index.php/ingenieria/article/view/471

doi
Dimensions
PlumX
license

 

Esta obra está bajo una licencia internacional

Atribución/Reconocimiento 4.0 Internacional
DARÍO ALEJANDRO GARCÍA

    DARÍO ALEJANDRO GARCÍA,

    Matemático de la Universidad Nacional de Colombia, Magíster en Matemáticas y Doctorado en Matemáticas de la Universidad de los Andes. Postdoctorado/Estancia postdoctoral UNIVERSITE CLAUDE BERNARD LYON 1 Mathématiques - Institut Camile Jordan. Postdoctorado/ Estancia postdoctoral UNIVERSITY OF LEEDS. Marie Curie Fellowship.


    What is the surest way to keep a message secret? The obvious answer to this question is, of course, to give the message uniquely and directly to the recipient. But, what happens if it is necessary to transmit the message through a medium in the presence of third parties? How can we ensure that the recipient receives the message and, at the same time, prevent anyone else from discovering it?


    Article visits 1416 | PDF visits 1442


    Downloads

    Download data is not yet available.
    Sistema OJS 3.4.0.5 - Metabiblioteca |