San Francisco / Boca Raton / Springer-Verlag / Barbara / Santa Barbara / Warsaw / Oppenheim / Boston / New York / Zurich / Berlin / Portland / Prague / IEEE / Providence / Washington / Lexington / Los Alamitos / Reading / London / Hoboken / /
Company
MIT Laboratory / Clarendon Press Oxford University Press / McGraw-Hill Book Co. / Cambridge University Press / Scribner Book Company / MIT Press / W. H. Freeman and Co. / ACM Press / Oxford University Press / Princeton University Press / John Wiley & Sons Inc. / Boston Inc. / Knopf Publishing Group / Xerox College Publishing / /
Country
Egypt / United States / Ireland / /
Facility
Prentice Hall / /
IndustryTerm
polynomial time discrete log algorithm / polynomial-time algorithm / round protocol / baseline parameter generation algorithm / polynomial time lattice basis reduction algorithms / secrecy systems / elliptic curve digital signature algorithm / large sparse linear systems / Square-root algorithms / Polynomial-time algorithms / Secure communications / factorization algorithm / computing / logarithm quantum algorithm / /
Organization
Cambridge University / MIT / American National Standards Institute / Princeton University / National Bureau of Standards / Oxford University / Royal Society / /
Person
L. Lov´ asz / A. K. Lenstra / O. Rabin / H. W. Lenstra / Jr. / Addison Welsley / /
Position
Governor / /
Product
Franklin / /
ProvinceOrState
New Jersey / Oregon / New York / New Mexico / Rhode Island / Florida / California / Massachusetts / /
PublishedMedium
the Theory of Computing / Cryptology ePrint Archive / Theory of Computing / Lecture Notes in Computer Science / /
Technology
baseline parameter generation algorithm / Polynomial-time algorithms / RSA encryption / Identity-based encryption / private key / non-secret encryption / improved Monte Carlo factorization algorithm / Seminumerical Algorithms / pdf / encryption / Square-root algorithms / cryptography / log algorithm / Public key / logarithm quantum algorithm / elliptic curve digital signature algorithm / polynomial-time algorithm / http / polynomial time lattice basis reduction algorithms / Digital Signature / one round protocol / block Wiedemann algorithm / /
References [1] M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Ann. of Math. (2), 160(2):781–793, [removed]L. V. Ahlfors. Complex Analysis. McGraw-Hill Book Co., New York, third edition, 1978. An introduction to