On powersmooth numbers

DOI10.3103/S1066369X1711007XzbMATH Open1412.11124MaRDI QIDQ681963FDOQ681963

F. F. Sharifullina

Publication date: 13 February 2018

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

Recommendations

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

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

• Title not available (Why is that?)
• Factoring integers with elliptic curves
• Title not available (Why is that?)
• An algorithm for counting smooth integers
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

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)