Peter L. Montgomery

According to our database, Peter L. Montgomery authored at least 25 papers between 1978 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Montgomery Arithmetic from a Software Perspective.

Joppe W. Bos, Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2017

2013

Montgomery Multiplication Using Vector Instructions.

Joppe W. Bos, Peter L. Montgomery, Daniel Shumow, Gregory M. Zaverucha

IACR Cryptol. ePrint Arch., 2013

2012

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

Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery

Int. J. Appl. Cryptogr., 2012

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

Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2012

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

Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé, Pascal Jermini, Michela Thiémard, Paul C. Leyland, Peter L. Montgomery, Andrey Timofeev, Heinz Stockinger

Clust. Comput., 2012

2010

The period of the Bell numbers modulo a prime.

Peter L. Montgomery, Sangil Nahm, Samuel S. Wagstaff Jr.

Math. Comput., 2010

An Analysis of Affine Coordinates for Pairing Computation.

Kristin E. Lauter, Peter L. Montgomery, Michael Naehrig

IACR Cryptol. ePrint Arch., 2010

Factorization of a 768-bit RSA modulus.

Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann

IACR Cryptol. ePrint Arch., 2010

Efficient SIMD arithmetic modulo a Mersenne number.

Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2010

Factorizations of Cunningham numbers with bases 13 to 99

Richard P. Brent, Peter L. Montgomery, Herman J. J. te Riele

CoRR, 2010

2009

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

Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2009

2008

On The Diffie-Hellman Assumption.

Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi

IACR Cryptol. ePrint Arch., 2008

Improved Stage 2 to P±1 Factoring Algorithms.

Peter L. Montgomery, Alexander Kruppa

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

2007

Vulnerabilities in Anonymous Credential Systems.

Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi

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

2006

Trading Inversions for Multiplications in Elliptic Curve Cryptography.

Mathieu Ciet, Marc Joye, Kristin E. Lauter, Peter L. Montgomery

Des. Codes Cryptogr., 2006

2005

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

Peter L. Montgomery

IEEE Trans. Computers, 2005

2003

Improved Weil and Tate pairings for elliptic and hyperelliptic curves.

Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2003

Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.

Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery

Proceedings of the Topics in Cryptology, 2003

2002

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

Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2002

2000

Factorization of a 512-Bit RSA Modulus.

Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Karen I. Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann

Proceedings of the Advances in Cryptology, 2000

1999

Factorization of RSA-140 Using the Number Field Sieve.

Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul C. Leyland, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Paul Zimmermann

Proceedings of the Advances in Cryptology, 1999

1996

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

James Cowie, Bruce Dodson, R. Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, Jörg Zayer

Proceedings of the Advances in Cryptology, 1996

1995

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

Peter L. Montgomery

Proceedings of the Advances in Cryptology, 1995

1994

Division by Invariant Integers using Multiplication.

Torbjörn Granlund, Peter L. Montgomery

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.

Peter L. Montgomery

ACM SIGPLAN Notices, 1978