M. E. Hellman, J. M. Reyneri, "Fast computation of discrete logarithms in GF (q)", in Advances in Cryptology: Proceedings of CRYPTO '82 (eds. D. Chaum, R. Rivest, A. Sherman), New York: Plenum Press, 1983, p. 3–13, online quote （页面存档备份，存于互联网档案馆） at Google Scholar: "Adleman refers to integers which factor completely into small primes as “smooth” numbers."
utexas.edu
cs.utexas.edu
Dijkstra, Edsger W., Hamming's exercise in SASL(PDF), 1981 [2013-01-15], Report EWD792. Originally a privately-circulated handwitten note, （原始内容存档(PDF)于2019-04-04）.
web.archive.org
M. E. Hellman, J. M. Reyneri, "Fast computation of discrete logarithms in GF (q)", in Advances in Cryptology: Proceedings of CRYPTO '82 (eds. D. Chaum, R. Rivest, A. Sherman), New York: Plenum Press, 1983, p. 3–13, online quote （页面存档备份，存于互联网档案馆） at Google Scholar: "Adleman refers to integers which factor completely into small primes as “smooth” numbers."
Dijkstra, Edsger W., Hamming's exercise in SASL(PDF), 1981 [2013-01-15], Report EWD792. Originally a privately-circulated handwitten note, （原始内容存档(PDF)于2019-04-04）.
