Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval-Reference-Cited by-同舟云学术

Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval

Published:2010 Issue: Volume: Page:368-383
ISSN:0302-9743
Container-title:Public Key Cryptography – PKC 2010
language:
Short-container-title:

Author:

Galbraith Steven D.,Ruprai Raminder S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-13013-7_22.pdf

Reference29 articles.

1. Lecture Notes in Computer Science;D. Boneh,2005

2. Bos, J.W., Kleinjung, T., Lenstra, A.K.: On the use of the negation map in the Pollard Rho method. (preprint, 2010)

3. Lecture Notes in Computer Science;J.H. Cheon,2006

4. Cofman, E.G., Flajolet, P., Flatto, L., Hofri, M.: The Maximum of a Random Walk and its Application to Rectangle Packing. Technical report, INRIA (1997)

5. Cohen, H., Frey, G.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. In: Discrete Mathematics and its Applications. Chapman & Hall/CRC, Boca Raton (2005)

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

1. Solving Small Exponential ECDLP in EC-Based Additively Homomorphic Encryption and Applications;IEEE Transactions on Information Forensics and Security;2023

2. Improving the Gaudry–Schost algorithm for multidimensional discrete logarithms;Designs, Codes and Cryptography;2021-10-29

3. Using Equivalent Class to Solve Interval Discrete Logarithm Problem;Information and Communications Security;2020

4. The Discrete-Logarithm Problem with Preprocessing;Advances in Cryptology – EUROCRYPT 2018;2018

5. Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm;Advances in Mathematics of Communications;2017