Peter L. Montgomery

Publication Activity (10 Years)

Years Active: 1978-2017
Publications (10 Years): 1

Top Topics

Pervasive Computing Environments

Integer Arithmetic

Top Venues

IACR Cryptol. ePrint Arch.

Int. J. Appl. Cryptogr.

Publications

Joppe W. Bos, Peter L. Montgomery
Montgomery Arithmetic from a Software Perspective. IACR Cryptol. ePrint Arch. 2017 (2017)
Joppe W. Bos, Peter L. Montgomery, Daniel Shumow, Gregory M. Zaverucha
Montgomery Multiplication Using Vector Instructions. IACR Cryptol. ePrint Arch. 2013 (2013)
Joppe W. Bos, Peter L. Montgomery, Daniel Shumow, Gregory M. Zaverucha
Montgomery Multiplication Using Vector Instructions. Selected Areas in Cryptography (2013)
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery
Finding ECM-Friendly Curves through a Study of Galois Properties CoRR (2012)
Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. Int. J. Appl. Cryptogr. 2 (3) (2012)
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery
Finding ECM-Friendly Curves through a Study of Galois Properties. IACR Cryptol. ePrint Arch. 2012 (2012)
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
A heterogeneous computing environment to solve the 768-bit RSA challenge. Clust. Comput. 15 (1) (2012)
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
Efficient SIMD Arithmetic Modulo a Mersenne Number. IEEE Symposium on Computer Arithmetic (2011)
Kristin E. Lauter, Peter L. Montgomery, Michael Naehrig
An Analysis of Affine Coordinates for Pairing Computation. Pairing (2010)
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
Efficient SIMD arithmetic modulo a Mersenne number. IACR Cryptol. ePrint Arch. 2010 (2010)
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
Factorization of a 768-bit RSA modulus. IACR Cryptol. ePrint Arch. 2010 (2010)
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
Factorization of a 768-Bit RSA Modulus. CRYPTO (2010)
Richard P. Brent, Peter L. Montgomery, Herman J. J. te Riele
Factorizations of Cunningham numbers with bases 13 to 99 CoRR (2010)
Peter L. Montgomery, Sangil Nahm, Samuel S. Wagstaff Jr.
The period of the Bell numbers modulo a prime. Math. Comput. 79 (271) (2010)
Kristin E. Lauter, Peter L. Montgomery, Michael Naehrig
An Analysis of Affine Coordinates for Pairing Computation. IACR Cryptol. ePrint Arch. 2010 (2010)
Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery
On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography. IACR Cryptol. ePrint Arch. 2009 (2009)
Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi
On The Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2008 (2008)
Peter L. Montgomery, Alexander Kruppa
Improved Stage 2 to P±1 Factoring Algorithms. ANTS (2008)
Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi
Vulnerabilities in Anonymous Credential Systems. Electron. Notes Theor. Comput. Sci. 197 (2) (2008)
Mathieu Ciet, Marc Joye, Kristin E. Lauter, Peter L. Montgomery
Trading Inversions for Multiplications in Elliptic Curve Cryptography. Des. Codes Cryptogr. 39 (2) (2006)
Peter L. Montgomery
Five, Six, and Seven-Term Karatsuba-Like Formulae. IEEE Trans. Computers 54 (3) (2005)
Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves. ANTS (2004)
Mathieu Ciet, Marc Joye, Kristin E. Lauter, Peter L. Montgomery
Trading Inversions for Multiplications in Elliptic Curve Cryptography. IACR Cryptol. ePrint Arch. 2003 (2003)
Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. CT-RSA (2003)
Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery
Improved Weil and Tate pairings for elliptic and hyperelliptic curves. IACR Cryptol. ePrint Arch. 2003 (2003)
Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery
An Efficient Procedure to Double and Add Points on an Elliptic Curve. IACR Cryptol. ePrint Arch. 2002 (2002)
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Karen Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann
Factorization of a 512-Bit RSA Modulus. EUROCRYPT (2000)
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
Factorization of RSA-140 Using the Number Field Sieve. ASIACRYPT (1999)
James Cowie, Bruce Dodson, R. Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, Jörg Zayer
A World Wide Number Field Sieve Factoring Record: On to 512 Bits. ASIACRYPT (1996)
Peter L. Montgomery
A Block Lanczos Algorithm for Finding Dependencies Over GF(2). EUROCRYPT (1995)
Torbjörn Granlund, Peter L. Montgomery
Division by Invariant Integers using Multiplication. PLDI (1994)
Peter L. Montgomery
Evaluation of boolean expressions on one's complement machines. ACM SIGPLAN Notices 13 (12) (1978)