Peter L. Montgomery

Available identifiers

zbMath Open montgomery.peter-lDBLP83/2204WikidataQ470485 ScholiaQ470485MaRDI QIDQ1758891

List of research outcomes

Publication	Date of Publication	Type
Montgomery Arithmetic from a Software Perspective	2023-04-21	Paper
Finding ECM-friendly curves through a study of Galois properties	2015-10-01	Paper
Montgomery Multiplication Using Vector Instructions	2015-10-01	Paper
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction	2012-11-16	Paper
An Analysis of Affine Coordinates for Pairing Computation	2010-11-26	Paper
The period of the Bell numbers modulo a prime	2010-08-30	Paper
Factorization of a 768-Bit RSA Modulus	2010-08-24	Paper
https://portal.mardi4nfdi.de/entity/Q3400314	2010-02-05	Paper
Improved Stage 2 to P ± 1 Factoring Algorithms	2008-05-27	Paper
Five, six, and seven-term Karatsuba-like formulae	2007-01-09	Paper
Trading inversions for multiplications in elliptic curve cryptography	2006-05-29	Paper
Algorithmic Number Theory	2005-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4536282	2004-01-26	Paper
https://portal.mardi4nfdi.de/entity/Q4418548	2003-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q2757235	2001-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4249695	1999-11-10	Paper
https://portal.mardi4nfdi.de/entity/Q4383627	1998-05-25	Paper
https://portal.mardi4nfdi.de/entity/Q4325965	1995-08-24	Paper
https://portal.mardi4nfdi.de/entity/Q4842285	1995-07-27	Paper
New Solutions of a p - 1 ≡1 (mod p 2 )	1993-11-09	Paper
An FFT Extension to the P - 1 Factoring Algorithm	1990-01-01	Paper
Tables of Fibonacci and Lucas factorizations	1988-01-01	Paper
Speeding the Pollard and Elliptic Curve Methods of Factorization	1987-01-01	Paper
Modular Multiplication Without Trial Division	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4071751	1975-01-01	Paper
Euclidean Ramsey theorems. I	1973-01-01	Paper

Research outcomes over time

This page was built for person: Peter L. Montgomery