On powersmooth numbers

DOI10.3103/S1066369X1711007XMaRDI QIDQ681963zbMATH OpenFDO

Authors 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)

Recommendations

• An algorithm for counting smooth integers
• Smooth numbers: computational number theory and beyond
• scientific article; zbMATH DE number 1186936
• Algorithmic Number Theory
• Smoothing ‘smooth’ numbers

Cites work

• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• scientific article; zbMATH DE number 3246419 (Why is no real title available?)
• An algorithm for counting smooth integers
• Factoring integers with elliptic curves
• Number theory

Cited in

(4)

• scientific article; zbMATH DE number 3977081 (Why is no real title available?)
• Algorithmic Number Theory
• Divisibility, smoothness and cryptographic applications
• Integers with a large smooth divisor

This page was built for publication: On powersmooth numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681963)