Computation of approximate L-th roots modulo n and application to cryptography
作者： Marc Girault , Philippe Toffin , Brigitte Vallée
关键词:
摘要: The goal of this paper is to give a unified view various known results (apparently unrelated) about numbers arising in crypto schemes as RSA, by considering them variants the computation approximate L-th roots modulo n. Here one may be interested number whose power "close" given number, or finding that its exact root. collects numerous algorithms which solve problems type.
springer.com
sci-hub.st 参考文章(20)
Marc Girault, Hash-functions using modulo-N operations theory and application of cryptographic techniques. pp. 217- 226 ,(1987) , 10.1007/3-540-39118-5_20
Lenore Blum, Manuel Blum, Michael Shub, Comparison of Two Pseudo-Random Number Generators international cryptology conference. pp. 61- 78 ,(1983) , 10.1007/978-1-4757-0602-4_6
Umesh V. Vazirani, Vijay V. Vazirani, Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) theory and application of cryptographic techniques. pp. 193- 202 ,(1984) , 10.1007/3-540-39568-7_17
Brigitte Vallée, Marc Girault, Philippe Toffin, How to guess ℓ-th roots modulo n by reducing lattice bases Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. pp. 427- 442 ,(1989) , 10.1007/3-540-51083-4_78
Wiebren de Jonge, David Chaum, Attacks on some RSA signatures international cryptology conference. pp. 18- 27 ,(1985) , 10.1007/3-540-39799-X_3
Ernest F. Brickell, John M. DeLaurentis, An attack on a signature scheme proposed by Okamoto and Shiraishi international cryptology conference. pp. 28- 32 ,(1985) , 10.1007/3-540-39799-X_4
John D. Dixon, Asymptotically fast factorization of integers Mathematics of Computation. ,vol. 36, pp. 255- 260 ,(1981) , 10.1090/S0025-5718-1981-0595059-1
Michael A. Morrison, John Brillhart, A method of factoring and the factorization of Mathematics of Computation. ,vol. 29, pp. 183- 205 ,(1975) , 10.1090/S0025-5718-1975-0371800-5
R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems Communications of the ACM. ,vol. 26, pp. 96- 99 ,(1983) , 10.1145/357980.358017
T. Okamoto, Modification of a public-key cryptosystem Electronics Letters. ,vol. 23, pp. 814- 815 ,(1987) , 10.1049/EL:19870577