The following pages link to Peter L. Montgomery (Q1758891):
Displaying 27 items.
- (Q1393233) (redirect page) (← links)
- Euclidean Ramsey theorems. I (Q1393234) (← links)
- Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction (Q1758892) (← links)
- Trading inversions for multiplications in elliptic curve cryptography (Q2491297) (← links)
- (Q2757235) (← links)
- Finding ECM-friendly curves through a study of Galois properties (Q2949486) (← links)
- Montgomery Multiplication Using Vector Instructions (Q2949546) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- New Solutions of a p - 1 ≡1 (mod p 2 ) (Q3137474) (← links)
- Modular Multiplication Without Trial Division (Q3347947) (← links)
- (Q3400314) (← links)
- Five, six, and seven-term Karatsuba-like formulae (Q3417015) (← links)
- An FFT Extension to the P - 1 Factoring Algorithm (Q3497176) (← links)
- Factorization of a 768-Bit RSA Modulus (Q3582763) (← links)
- The period of the Bell numbers modulo a prime (Q3584850) (← links)
- Speeding the Pollard and Elliptic Curve Methods of Factorization (Q3748330) (← links)
- Tables of Fibonacci and Lucas factorizations (Q3772275) (← links)
- (Q4071751) (← links)
- (Q4249695) (← links)
- (Q4325965) (← links)
- (Q4383627) (← links)
- (Q4418548) (← links)
- (Q4536282) (← links)
- (Q4842285) (← links)
- Improved Stage 2 to P ± 1 Factoring Algorithms (Q5387598) (← links)
- Algorithmic Number Theory (Q5465618) (← links)
- Montgomery Arithmetic from a Software Perspective (Q5888176) (← links)
