A Survey of Hard Core Functions
作者： Maria Isabel González Vasco , Mats Näslund
DOI: 10.1007/978-3-0348-8295-8_18
关键词:
摘要: The security of public key protocols relies nowadays on the use one-way functions. However, even assuming a certain function f(x) is hard enough to invert, we should always keep in mind fact that some information may leak through. A b(x) does not this way said be core for f; given f(x), cannot computationally distinguished from random string. In survey, review what known area, both more theoretical point view and also ‘practical’ choices f such as RSA.
springer.com
sci-hub.st 参考文章(55)
Mats Näslund, All Bits in ax + b mod p are Hard international cryptology conference. pp. 114- 128 ,(1996) , 10.1007/3-540-68697-5_10
Douglas Leroy Long, The security of bits in the discrete logarithm Princeton University. ,(1984)
Dan Boneh, Studies in computational number theory with applications to cryptography Princeton University. ,(1996)
Umesh V. Vazirani, Vijay V. Vazirani, RSA bits are .732 + ε secure Advances in Cryptology. pp. 369- 375 ,(1984) , 10.1007/978-1-4684-4730-9_26
Benny Chor, Oded Goldreich, RSA/Rabin least significant bits are \( \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} \) secure (Extended Abstract) theory and application of cryptographic techniques. pp. 303- 313 ,(1984) , 10.1007/3-540-39568-7_24
Maria Isabel González Vasco, Igor E. Shparlinski, On the Security of Diffie-Hellman Bits Electronic Colloquium on Computational Complexity. ,vol. 7, pp. 257- 268 ,(2001) , 10.1007/978-3-0348-8295-8_19
Eric R. Verheul, Certificates of Recoverability with Scale Recovery Agent Security public key cryptography. pp. 258- 275 ,(2000) , 10.1007/978-3-540-46588-1_18
Mikael Goldmann, Mats NÄslund, The Complexity of Computing Hard Core Predicates international cryptology conference. pp. 1- 15 ,(1997) , 10.1007/BFB0052224
Michael George Luby, None, Pseudorandomness and Cryptographic Applications ,(1996)
A. W. Schrift, Adi Shamir: On the Universality of the Next Bit Test international cryptology conference. pp. 394- 408 ,(1990)