A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
[chapter]
Advances in Cryptology — EUROCRYPT '91
Preserved Fulltext
Let N be an integer with at least two distinct prime factors. We reduce the problem of factoring N to the task of nding t + 2 integer solutions
doi:10.1007/3-540-46416-6_24
dblp:conf/eurocrypt/Schnorr91
fatcat:p53unzrtpfgtbe6we3vhtm743m