Abstract
In this paper some basic concepts about cryptography are described. Some examples of simple cryptosystems are gíven and fmally a protocol based on quantum príncíples that enables to make codíng almost secure agaínst the attack of eavesdroppers is presented.
LENSTRA, A., M. MANASSYEJ. POLLAR(D1990), The Number Field Sieve. Proceedíngs of the 22nd ACM Symposium on the Theory of Computing, pp. 564-572.
MULLINS, J. (2002), Making Unbreakab/e Code, IEEE Espectrum.
REIFFEL, E. Y W. POLAK (2000), Introduction to Quantum Computingfor Non-Physicist, Los Alamos Physics Preprint Archive.
SHOR, P. (1994), Algorithms for Quantum Computation: Discrete Logaríthms and Factoríng. Proceedíngs of the 35th Annual Symposium of Computer Science, pp. 124-134.
SILVERMAN, R. (1987), MathematicalComputing, 48, p. 329.
STINSON, D. (1995), Cnjptoqraphu. Theory andPractice, CRC Press.
WILLIAMS, C. y S, CLEARWAT(E1R997), Explorations in Quantum Computing, Springer.

This work is licensed under a Creative Commons Attribution 4.0 International License.