New Results on the Hardness of Diffie-Hellman Bits-Reference-Cited by-同舟云学术

New Results on the Hardness of Diffie-Hellman Bits

Published:2004 Issue: Volume: Page:159-172
ISSN:0302-9743
Container-title:Public Key Cryptography – PKC 2004
language:
Short-container-title:

Author:

González Vasco María Isabel,Näslund Mats,Shparlinski Igor E.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24632-9_12

Reference35 articles.

1. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. 33rd ACM Symp. on Theory of Comput., pp. 601–610. ACM, New York (2001)

2. Lecture Notes in Computer Science;M. Bellare,1998

3. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proc. 1st ACM Computer and Communication Security 1993, pp. 62–73. ACM Press, New York (1993)

4. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comp. 13, 850–864 (1984)

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

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

1. On the Bit Security of Elliptic Curve Diffie–Hellman;Lecture Notes in Computer Science;2017

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

3. More efficient DDH pseudorandom generators;Designs, Codes and Cryptography;2009-09-30

4. Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes;Automata, Languages and Programming;2006

5. On the bit security of the Diffie-Hellman key;Applicable Algebra in Engineering, Communication and Computing;2005-11-07