Factoring

Factoring, finding a non-trivial factorization of a composite positive integer, is believed to be a hard problem. How hard we think it is, however, changes almost on a daily basis. Predicting how hard factoring will be in the future, an important issue for cryptographic applications of composite numbers, is therefore a challenging task. The author presents a brief survey of general purpose integer factoring algorithms and their implementations


Published in:
Distributed Algorithms. 8th International Workshop, WDAG '1994. Proceedings, 857, 28 - 38
Presented at:
Distributed Algorithms. 8th International Workshop, WDAG '1994. Proceedings, Berlin, Germany
Year:
1994
ISSN:
03029743
Keywords:
Laboratories:




 Record created 2010-06-24, last modified 2018-03-17

Postprint:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)