Loading...
conference paper
Factoring
1994
Distributed Algorithms. 8th International Workshop, WDAG '1994. Proceedings
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
Loading...
Name
149488.PDF
Access type
openaccess
Size
1.98 MB
Format
Adobe PDF
Checksum (MD5)
55d7cd3668170d3efd2b3fca4b1dec93