On powersmooth numbers
Copyright policy )On powersmooth numbers
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Kazan Federal University Russian Federation
powersmooth integers, Pollard’s (p − 1)-factorization algorithm, Lenstra’s elliptic curve factorization method, Lenstra's elliptic curve factorization method, 510, 004, RSA, factorization, Asymptotic results on arithmetic functions, Pollard's \((p - 1)\)-factorization algorithm, smooth integers, estimates for cryptographic algorithms, Distribution of integers with specified multiplicative constraints
powersmooth integers, Pollard’s (p − 1)-factorization algorithm, Lenstra’s elliptic curve factorization method, Lenstra's elliptic curve factorization method, 510, 004, RSA, factorization, Asymptotic results on arithmetic functions, Pollard's \((p - 1)\)-factorization algorithm, smooth integers, estimates for cryptographic algorithms, Distribution of integers with specified multiplicative constraints
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!