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


Publié dans:
Distributed Algorithms. 8th International Workshop, WDAG '1994. Proceedings, 857, 28 - 38
Présenté à:
Distributed Algorithms. 8th International Workshop, WDAG '1994. Proceedings, Berlin, Germany
Année
1994
ISSN:
03029743
Mots-clefs:
Laboratoires:




 Notice créée le 2010-06-24, modifiée le 2018-09-13

Postprint:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)