DMCA
Some Parallel Algorithms for Integer Factorisation (1999)
Cached
Download Links
| Venue: | Proc. Third Australian Supercomputer Conference |
| Citations: | 43 - 17 self |
BibTeX
@INPROCEEDINGS{Brent99someparallel,
author = {Richard P. Brent and T E Xe},
title = {Some Parallel Algorithms for Integer Factorisation},
booktitle = {Proc. Third Australian Supercomputer Conference},
year = {1999},
pages = {pp.}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Algorithms for finding the prime factors of large composite numbers are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presumed difficulty of the factorisation problem. In recent years the limits of the best integer factorisation algorithms have been extended greatly, due in part to Moore's law and in part to algorithmic improvements. It is now routine to factor 100-decimal digit numbers, and feasible to factor numbers of 155 decimal digits (512 bits). We describe several integer factorisation algorithms, consider their suitability for implementation on parallel machines, and give examples of their current capabilities.
Keyphrases
integer factorisation parallel algorithm 100-decimal digit number recent year parallel machine decimal digit algorithmic improvement large composite number current capability factorisation problem practical importance prime factor public key cryptosystems presumed difficulty several integer factorisation algorithm integer factorisation algorithm widespread use
