(Enter summary)
Abstract: The problem of integer factorisation has been around for a very long time. This report describes a number of algorithms and methods for performing factorisation. Particularly, the Trial Divisions and Fermat algorithms are dicussed. Furthermore, Pollard's ρ and p-1 methods are described, and finally Lenstra's Elliptic Curves method. The theory behind each algorithm is explained, so that the reader can become familiar with the process. Then, a sample pseudocode is presented, along with the... (Update)
Active bibliography (related documents): More All
0.4: Generalised Cycling Attacks on RSA - Gysin, Seberry
(Correct)
0.4: Some New Pollard ρ's and Attacks for RSA - Gysin (1997)
(Correct)
0.2: Some Parallel Algorithms for Integer Factorisation - Brent (1999)
(Correct)
Similar documents based on text:
1.0: Unknown -
(Correct)
BibTeX entry: (Update)
@misc{ kostakos01integer,
author = "Vassilis Kostakos",
title = "Integer Factorisation",
year = "2001",
url = "citeseer.ist.psu.edu/kostakos01integer.html" }
Citations (may not include all citations):
223
The art of computer programming (context) - Knuth - 1981
68
Prime numbers and computer methods for factorization (context) - Riesel - 1985
42
An improved monte carlo factorization algorithm (context) - Brent - 1980
8
Primality and cryptography (context) - Kranakis - 1986
7
Some parallel algorithms for integer factorisation
- Brent - 1999
5
Theorems on factorisation and primality testing (context) - Pollard - 1974
5
Nordisk Tidskrift for Informationsbehandling (context) - Pollard, carlo et al. - 1975
1
Integer factorisation (context) - Naur - 1982
Documents on the same site (http://www.cs.bath.ac.uk/~vk/projects.htm):
It Was the 9 - Th Of October
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC