Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves-Reference-Cited by-同舟云学术

Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves

Published:2012 Issue: Volume: Page:832-849
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Duc Alexandre,Jetchev Dimitar

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-32009-5_48

Reference39 articles.

1. Akavia, A.: Learning Noisy Characters, Multiplication Codes, and Cryptographic Hardcore Predicates. Ph.D. thesis, Massachusetts Institute of Technology (2008)

2. Akavia, A., Goldwasser, S., Safra, S.: Proving Hard-Core Predicates Using List Decoding. In: FOCS, pp. 146–157. IEEE Computer Society (2003)

3. 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)

4. Blum, M., Micali, S.: How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Comput. 13(4), 850–864 (1984)

5. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian (ed.) [25], pp. 213–229

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bit Security of the Hyperelliptic Curves Diffie-Hellman Problem;Provable Security;2017

2. Rounding Technique’s Application in Schnorr Signature Algorithm: Known Partially Most Significant Bits of Nonce;Applications and Techniques in Information Security;2017

3. The Security of Individual Bit for XTR;Information and Communications Security;2016

4. Bit Security of the CDH Problems over Finite Fields;Lecture Notes in Computer Science;2016

5. The Multivariate Hidden Number Problem;Lecture Notes in Computer Science;2015