Author:
Lv Kewei,Qin Wenjie,Wang Ke
Publisher
Springer International Publishing
Reference8 articles.
1. Alexi, W., Chor, B., Goldreich, O., Schnorr, C.: RSA and rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17(2), 194–209 (1988)
2. Goldreich, O., Rosen, V.: On the security of modular exponentiation with application to the construction of pseudorandom generators. J. Cryptology 16, 71–93 (2003)
3. Goldreich, O., Rosen, V.: On the security of modular exponentiation with application to the construction of pseudorandom generators. ECCC, TR02-049 (2002)
4. Håstad, J., Nüsland, M.: The security of all RSA and discrete log bits. J. ACM 51(2), 187–230 (2004)
5. Håstad, J., Schrift, A.W., Shamir, A.: The discrete logarithm modulo a composite hides $$O(n)$$ O ( n ) bits. J. Comput. Syst. Sci. 47, 376–404 (1993)