Smooth orders and cryptographic applications

DOI10.1007/3-540-45455-1_27MaRDI QIDQ4737496zbMATH OpenFDO

Authors Carl Pomerance, Igor E. Shparlinski

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2369/23690338.htm

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Cryptography (94A60)

Recommendations

• Smooth values of shifted primes in arithmetic progressions
• Algorithmic Number Theory
• Divisibility, smoothness and cryptographic applications
• Smooth numbers: computational number theory and beyond
• A hyperelliptic smoothness test. I

Cited in

(15)

• Integers without large prime factors
• Square-free values of the Carmichael function.
• Primality testing with Gaussian periods
• Smooth values of shifted primes in arithmetic progressions
• A recurrent construction of irreducible polynomials of fixed degree over finite fields
• Multiplicative congruences with variables from short intervals
• Values of the Euler function in various sequences
• On the number of strong primes
• Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\)
• Integers with a large smooth divisor
• Divisibility, smoothness and cryptographic applications
• The reciprocal sum of divisors of Mersenne numbers
• Poisson approximation of prime divisors of shifted primes
• Small values of Carmichael's -function
• On digit sums of multiples of an integer

This page was built for publication: Smooth orders and cryptographic applications

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