Abstract
The goal of this paper is to give a unified view of various known results (apparently unrelated) about numbers arising in crypto schemes as RSA, by considering them as variants of the computation of approximate L-th roots modulo n. Here one may be interested in a number whose L-th power is “close” to a given number, or in finding a number that is “close” to its exact L-th root. The paper collects numerous algorithms which solve problems of this type.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
VII. References
W. Alexi, B. Chor, O. Goldreich and C.P. Schnorr, “RSA and Rabin functions: certain parts are as hard as the whole”, SIAM J. Comp., Vol. 17, pp. 194–209, 1988.
L. Blum, M. Blum and M. Shub, “Comparison of two pseudo-random number generators”, Advances in Cryptology, Proc. of Crypto 82, Plenum press, New York, 1983, pp.61–78.
E. Brickell and A. Odlyzko, “Cryptanalysis: a survey of recent results”, Proc. of the IEEE, Vol. 76, no 5, May 1988, pp. 578–593.
E. Brickell and J. Delaurentis, “An attack on a signature scheme proposed by Okamoto and Shiraishi”, Proc. of Crypto’ 85, LNCS, Vol. 218, Springer-Verlag, 1986, pp.10–14.
J.D. Dixon, “Asymptotical fast factorization of integers”, Math. Comp., Vol. 36, 1981, pp. 255–260.
W. De Jonge and D. Chaum, “Attacks on some RSA signatures”, Advances in Cryptology, Proc. of Crypto’ 85, LNCS, Vol. 218, Springer-Verlag, 1986, pp. 18–27.
M. Girault, “Hash-functions using modulo-n operations”, Proc. of Eurocrypt’ 87, LNCS, Vol. 304, Springer-Verlag, 1988, pp. 217–226.
S. Goldwasser, S. Micali and P. Tong, “Why and how to establish a private code on a public network”, Proc. of the 23rd IEEE FOCS, 1982, pp. 134–144.
A.K. Lenstra, H.W. Lenstra and L. Lovasz, “Factoring polynomials with integer coefficients”, Mathematische Annalen, 1982, Vol. 261, pp. 513–534.
M.A. Morrison and J. Brillhart, “A method of factorization and the factorization of F7”, Math. Comput., Vol. 29, 1975, pp. 183–205.
T. Okamoto, “Fast public-key cryptosystem using congruent polynomial equations”, Electronics Letters, 1986, Vol.22, pp. 581–582.
T. Okamoto, “Modification of a public-key cryptosystem”. Electronics Letters, 1987, Vol. 23, pp.814–815.
T. Okamoto and A. Shiraishi, “A fast signature scheme based on quadratic inequalities”, Proc. of the 1985 Symposium on Security and Privacy, Apr.1985, Oakland, CA.
R.L. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems”, CACM, Vol. 21, no2, Feb. 1978, pp. 120–126.
B. Vallée “Integer factorisation with quasi-uniform generation of small quadratic residues”, presented at “Computational Number Theory” Conference, Bodwin College, Jul. 88; submitted to Compte Rendus de l’ Académie des Sciences de Paris (preprint available from the author).
B. Vallée, M. Girault and P. Toffin, “How to break Okamoto’s cryptosystem by reducing lattice bases”, Proc. of Eurocrypt’ 88, to appear.
B. Vallée, M. Girault and P. Toffin, “How to guess L-th roots modulo n by reducing lattice bases”, Proc. of Conference of ISSAC-88 and AAECC-6, Jul. 88, to appear.
U.V. Vazirani and V.V. Vazirani, “Efficient and secure pseudo-random number generation”, Advances in Cryptology, Proc. of Crypto’ 84, LNCS, Vol. 196, Springer-Verlag, 1985, pp.193–202.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Girault, M., Toffin, P., Vallée, B. (1990). Computation of Approximate L-th Roots Modulo n and Application to Cryptography. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_9
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_9
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive