On powersmooth numbers

DOI10.3103/S1066369X1711007XzbMath1412.11124MaRDI QIDQ681963

F. F. Sharifullina

Publication date: 13 February 2018

Published in: Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

RSAfactorizationsmooth integersestimates for cryptographic algorithmsLenstra's elliptic curve factorization methodPollard's \((p - 1)\)-factorization algorithmpowersmooth integers

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Distribution of integers with specified multiplicative constraints (11N25)

Cites Work

• An algorithm for counting smooth integers
• Factoring integers with elliptic curves
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On powersmooth numbers