|
|
ffl Some Statistics for NFS Factorizations
– unknown authors
- 2002
|
|
17
|
Recent progress and prospects for integer factorisation algorithms
– Richard P. Brent
- 2000
|
|
39
|
Parallel Algorithms for Integer Factorisation
– Richard P. Brent
|
|
2
|
FaceCerts
– Darko Kirovski, Nebojsa Jojic
- 2003
|
|
2
|
Factoring large integers using parallel Quadratic Sieve
– Olof Åsbrink, Joel Brynielsson
- 2000
|
|
32
|
A tale of two sieves
– Carl Pomerance
- 1996
|
|
|
1. The World’s Oldest Algorithm. Arithmetic and numbers have always fascinated
– Ezra Brown
|
|
|
Three Connections to Continued Fractions
– Ezra Brown
- 2003
|
|
|
Sequences of Reducible {0, 1}–Polynomials Modulo a Prime
– Judith Canner, Lenny Jones, Joseph Purdom
|
|
|
A Closer look at RSA and ECC
– Aditya Kumar Kommera, Keerthana Kommera, Praneeth Kumar Gunda
|
|
|
MAT3166: Elementary Number Theory Fall 2011 Course Notes, University of Ottawa
– Prof Monica Nevins
- 2011
|
|
|
unknown title
– unknown authors
|
|
|
A CUSP SINGULARITY WITH NO GALOIS COVER BY A COMPLETE INTERSECTION
– David E. Anderson
- 2001
|
|
|
Factorizations of a^n ± 1, 13 ≤ a < 100: Update 2
– Richard P. Brent, Peter L. Montgomery, Herman J. J. te Riele, Henk Boender, Marije Elkenbracht-huizing, Robert Silverman, Thomas Sosnowski
- 1996
|
|
|
Faster Algorithms To Find Non-Squares Modulo Worst-Case Integers
– Daniel Bernstein
|
|
|
Article 03.4.5
– Journal Of Integer, Douglas E. Iannucci, Deng Moujie, Graeme L. Cohen
- 47
|
|
|
Factorizations of a^n±1, 13 ≤ a < 100: Update 2
– Richard P. Brent, Peter L. Montgomery, Herman J.J. te Riele, Henk Boender, Marije Elkenbracht-huizing, Robert Silverman, Thomas Sosnowski
|
|
|
VERIFYING THE GOLDBACH CONJECTURE UP TO 4 · 10 14
– unknown authors
|
|
|
MO419 – Probabilistic Algorithms – Flávio K. Miyazawa – IC/UNICAMP 2010 A survey on Probabilistic Algorithms to Primality Test
– Marcio Machado, Pereira Ra, Marco Alves, Ganhoto Ra
|
