Abstract
For exponentiation function modulo a composite \(f_{g,N}(x)=g^x \mod N\), where \(|N|=n\), an elegant algorithm is constructed by Goldreich and Rosen to reprove that the upper and lower half bits of this function are simultaneously hard separately under the factoring intractability assumption. Here we improve their algorithm to reduce the time by a factor \(\mathcal {O}(\log n\epsilon ^{-1})\). If error probability \(\frac{1}{2^{(1-1/2c)m}}\) is tolerated, the reduced factor could be \(\mathcal {O}((n\epsilon ^{-1})^{1/2c})\) for a constant \(c\ge 2\).
This work is partially supported by NSF No. 61272039.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Goldreich, O., Rosen, V.: On the security of modular exponentiation with application to the construction of pseudorandom generators. J. Cryptology 16, 71–93 (2003)
Goldreich, O., Rosen, V.: On the security of modular exponentiation with application to the construction of pseudorandom generators. ECCC, TR02-049 (2002)
Håstad, J., Nüsland, M.: The security of all RSA and discrete log bits. J. ACM 51(2), 187–230 (2004)
Håstad, J., Schrift, A.W., Shamir, A.: The discrete logarithm modulo a composite hides \(O(n)\) bits. J. Comput. Syst. Sci. 47, 376–404 (1993)
Su, D., Lv, K.: A new hard-core predicate of Paillier’s trapdoor function. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol. 5922, pp. 263–271. Springer, Heidelberg (2009)
Su, D., Lv, K.: Pailliers trapdoor function hides \(\varTheta (n)\) bits. Sci. China Inform. Sci. 54(9), 1827–1836 (2011)
Su, D., Wang, K., Lv, K.: The bit security of two variants of Pailliers trapdoor function. Chinese J. Comput. 6, 1050–1059 (2010)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Lv, K., Qin, W., Wang, K. (2016). Improved Security Proof for Modular Exponentiation Bits. In: Chen, J., Piuri, V., Su, C., Yung, M. (eds) Network and System Security. NSS 2016. Lecture Notes in Computer Science(), vol 9955. Springer, Cham. https://doi.org/10.1007/978-3-319-46298-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-46298-1_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46297-4
Online ISBN: 978-3-319-46298-1
eBook Packages: Computer ScienceComputer Science (R0)