Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2017

2013

Montgomery Multiplication Using Vector Instructions.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography - SAC 2013, 2013

2012

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

[BibT_eX]

[DOI]

Int. J. Appl. Cryptogr., 2012

Finding ECM-Friendly Curves through a Study of Galois Properties.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

A heterogeneous computing environment to solve the 768-bit RSA challenge.

[BibT_eX]

[DOI]

Clust. Comput., 2012

2011

Efficient SIMD Arithmetic Modulo a Mersenne Number.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Computer Arithmetic, 2011

2010

The period of the Bell numbers modulo a prime.

[BibT_eX]

[DOI]

Sangil Nahm

Samuel S. Wagstaff Jr.

Math. Comput., 2010

Factorizations of Cunningham numbers with bases 13 to 99

[BibT_eX]

[DOI]

Richard P. Brent

CoRR, 2010

An Analysis of Affine Coordinates for Pairing Computation.

[BibT_eX]

[DOI]

Michael Naehrig

Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

Factorization of a 768-Bit RSA Modulus.

[BibT_eX]

[DOI]

Andrey Timofeev

Paul Zimmermann

Proceedings of the Advances in Cryptology, 2010

2009

On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

2008

On The Diffie-Hellman Assumption.

[BibT_eX]

[DOI]

Raghav Bhaskar

K. Chandrasekaran

Satyanarayana V. Lokam

Ramarathnam Venkatesan

Yacov Yacobi

IACR Cryptol. ePrint Arch., 2008

Improved Stage 2 to P±1 Factoring Algorithms.

[BibT_eX]

[DOI]

Alexander Kruppa

Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007

Vulnerabilities in Anonymous Credential Systems.

[BibT_eX]

[DOI]

Raghav Bhaskar

K. Chandrasekaran

Satyanarayana V. Lokam

Ramarathnam Venkatesan

Yacov Yacobi

Proceedings of the 3rd International Workshop on Security and Trust Management, 2007

2005

Five, Six, and Seven-Term Karatsuba-Like Formulae.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2005

2004

Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves.

[BibT_eX]

[DOI]

Kirsten Eisenträger

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003

Trading Inversions for Multiplications in Elliptic Curve Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2003

Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.

[BibT_eX]

[DOI]

Kirsten Eisenträger

Proceedings of the Topics in Cryptology, 2003

2002

An Efficient Procedure to Double and Add Points on an Elliptic Curve.

[BibT_eX]

[DOI]

Kirsten Eisenträger

IACR Cryptol. ePrint Arch., 2002

2000

Factorization of a 512-Bit RSA Modulus.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2000

1999

Factorization of RSA-140 Using the Number Field Sieve.

[BibT_eX]

[DOI]

R. Marije Elkenbracht-Huizing

Paul Zimmermann

Proceedings of the Advances in Cryptology, 1999

1996

A World Wide Number Field Sieve Factoring Record: On to 512 Bits.

[BibT_eX]

[DOI]

James Cowie

Bruce Dodson

Arjen K. Lenstra

Jörg Zayer

Proceedings of the Advances in Cryptology, 1996

1995

A Block Lanczos Algorithm for Finding Dependencies Over GF(2).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1995

1994

Division by Invariant Integers using Multiplication.

[BibT_eX]

[DOI]

Torbjörn Granlund

Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI), 1994

1978

Evaluation of boolean expressions on one's complement machines.

[BibT_eX]

[DOI]