On random walks for Pollard's Rho method

The parallelized Pollard kangaroo method in real Quadratic function fields

Mathematics of Computation

Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms

SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography

Random Cayley Digraphs and the Discrete Logarithm

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory

Factoring N = pq with the Elliptic Curve Method

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory

Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions

CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems

Computing discrete logarithms with the parallelized kangaroo method

Discrete Applied Mathematics - Special issue on the 2000 com2MaC workshop on cryptography

On the efficiency of Pollard's rho method for discrete logarithms

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77

Collision Search for Elliptic Curve Discrete Logarithm over GF(2m) with FPGA

CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems

Speeding Up the Pollard Rho Method on Prime Fields

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology

Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$

Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09

Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem

Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography

An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems

Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding

On the correct use of the negation map in the Pollard rho method

PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography

Spectral analysis of pollard rho collisions

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory

Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction

International Journal of Applied Cryptography

Computing elliptic curve discrete logarithms with the negation map

Information Sciences: an International Journal

Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction

International Journal of Applied Cryptography

Solving a discrete logarithm problem with auxiliary input on a 160-bit elliptic curve

PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography

Cryptanalysis of RSA with a small parameter

ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy

On the strength comparison of the ECDLP and the IFP

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks

Speeding up elliptic curve discrete logarithm computations with point halving

Designs, Codes and Cryptography

A hardware-accelerated ECDLP with high-performance modular multiplication

International Journal of Reconfigurable Computing - Special issue on Selected Papers from the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig 2011)