Cryptography Reference
In-Depth Information
[5]
Shor, P.W., “Algorithms for Quantum Computation: Discrete Logarithms and Factoring,”
Pro-
ceedings of the IEEE 35th Annual Symposium on Foundations of Computer Science (FOCS)
,
Santa Fe, NM, November 1994, pp. 124-134.
[6]
Shor, P.W., “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a
Quantum Computer,”
SIAM Journal of Computing
, October 1997, pp. 1484-1509.
[7]
Vandersypen, L.M.K., et al., “Experimental Realization of Shor's Quantum Factoring Algorithm
Using Nuclear Magnetic Resonance,”
Nature
, Vol. 414, 2001, pp. 883-887.
[8]
Nielsen, M., and I.L. Chuang,
Quantum Computation and Quantum Information.
Cambridge
University Press, Cambridge, UK, 2000.
[9]
Adleman, L.M., “Molecular Computation of Solutions to Combinatorial Problems,”
Science
,Vol.
266, November 1994, pp. 1021-1024.
[10]
Lipton, R.J., “DNA Solution of Hard Computational Problems,”
Science
, Vol. 268, April 1995,
pp. 542-545.
[11]
Paun, G., G. Rozenberg, and A. Salomaa,
DNA Computing: New Computing Paradigms.
Springer-
Verlag, New York, 1998.
[12]
Maurer, U.M.,
Cryptography 2000
±
10
, Springer-Verlag, New York, LNCS 2000, 2000, pp. 63-
85.
[13]
Ajtai, M., “Generating Hard Instances of Lattice Problems,”
Proceedings of 28th ACM Sympo-
sium of the Theory of Computing (STOC)
, Philadelphia, PA, May 1996, pp. 99-108.
