On the complexity of the discrete logarithm and Diffie–Hellman problems-Reference-Cited by-同舟云学术

On the complexity of the discrete logarithm and Diffie–Hellman problems

Published:2004-04 Issue:2-3 Volume:20 Page:148-170
ISSN:0885-064X
Container-title:Journal of Complexity
language:en
Short-container-title:Journal of Complexity

Author:

Blake Ian F.,Garefalakis Theo

Publisher

Elsevier BV

Subject

Applied Mathematics,Control and Optimization,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,General Mathematics

Reference51 articles.

1. M. Ajtai, S. Ravi Kumar, D. Sivakumar, A sieve algorithm for the shortest lattice vector problem, in: 33rd Annual ACM Symposium on Theory of Computing, 2001.

2. Breaking generalized Diffie–Hellman modulo a composite is no easier than factoring;Biham;Inform. Process. Lett.,1997

3. Elliptic Curves in Cryptography;Blake,1999

4. D. Boneh, The decision Diffie–Hellman problem, ANTS III, in: J.P. Buhler (Ed.), Lecture Notes in Computer Science, Vol. 1423, Springer, Berlin, 1998, pp. 48–63.

5. Algorithms for black-box fields and their application to cryptography;Boneh,1996

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

1. Undeniable Authentication of Digital Twin-managed Smart Microfactory;2024 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events (PerCom Workshops);2024-03-11

2. An approach for designing fast public key encryption systems using white-box cryptography techniques;Journal of Computer Virology and Hacking Techniques;2024-02-10

3. Secure Fair Aggregation Based on Category Grouping in Federated Learning;2024

4. Robustness Analysis of Zero Knowledge Proofs using Diffie Hellman Problem;2022 2nd International Conference on Technological Advancements in Computational Sciences (ICTACS);2022-10-10

5. Extensions of the Diffie-Hellman Key Agreement Protocol Based on Exponential and Logarithmic Functions;Intelligent Information and Database Systems;2022