Solving Discrete Logarithms from Partial Knowledge of the Key-Reference-Cited by-同舟云学术

Solving Discrete Logarithms from Partial Knowledge of the Key

Published: Issue: Volume: Page:224-237
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Gopalakrishnan K.,Thériault Nicolas,Yao Chui Zhi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-77026-8_17.pdf

Reference24 articles.

1. Brier, É., Déchène, I., Joye, M.: Unified point addition formulæ for elliptic curve cryptosystems. In: Embedded Cryptographic Hardware: Methodologies and Architectures, pp. 247–256. Nova Science Publishers (2004)

2. Lecture Notes in Computer Science;É. Brier,2002

3. Cheng, Q.: On the bounded sum-of-digits discrete logarithm problem in finite fields. SIAM J. Comput. 34(6), 1432–1442 (2005)

4. Lecture Notes in Computer Science;K. Gandolfi,2001

5. Gordon, D.M.: A survey of fast exponentiation methods. Journal of Algorithms 27, 129–146 (1998)

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

1. Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates;Information and Communications Security;2018

2. On the Possibility of Transformation of Multidimensional ECDLP into 1-Dimensional ECDLP;Number-Theoretic Methods in Cryptology;2018

3. Attacking Embedded ECC Implementations Through cmov Side Channels;Lecture Notes in Computer Science;2017

4. Indistinguishable Proofs of Work or Knowledge;Advances in Cryptology – ASIACRYPT 2016;2016

5. On the Security of the (F)HMQV Protocol;Progress in Cryptology – AFRICACRYPT 2016;2016