Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes-Reference-Cited by-同舟云学术

Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes

Published:2006 Issue: Volume: Page:240-251
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Fouque Pierre-Alain,Pointcheval David,Stern Jacques,Zimmer Sébastien

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11787006_21.pdf

Reference34 articles.

1. Lecture Notes in Computer Science;M. Bellare,2001

2. Bellare, M., Rogaway, P.: Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In: Proc. of the 1st CCS, pp. 62–73. ACM Press, New York (1993)

3. Blake, I.F., Garefalakis, T., Shparlinski, I.E.: On the bit security of the Diffie-Hellman key. Appl. Algebra in Engin., Commun. and Computing 16, 397–404 (2006)

4. Lecture Notes in Computer Science;D. Boneh,1998

5. Lecture Notes in Computer Science;D. Boneh,1996

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

1. NON-MALLEABLE RANDOMNESS EXTRACTORS;National Security Studies;2014-12-05

2. Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks;Advances in Cryptology – CRYPTO 2010;2010

3. Cryptographic Extraction and Key Derivation: The HKDF Scheme;Advances in Cryptology – CRYPTO 2010;2010

4. How to Extract and Expand Randomness: A Summary and Explanation of Existing Results;Applied Cryptography and Network Security;2009

5. Optimal Randomness Extraction from a Diffie-Hellman Element;Advances in Cryptology - EUROCRYPT 2009;2009