On the number of sparse RSA exponents

DOI10.1006/jnth.2001.2775zbMath1033.11045OpenAlexW2007786102MaRDI QIDQ701120

Igor E. Shparlinski, William D. Banks

Publication date: 16 October 2002

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10355/10626

zbMATH Keywords

RSAmodular exponentiationsum of digitssparse exponents

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications of sieve methods (11N36) Radix representation; digital problems (11A63)

Related Items

Fixed points of the RSA encryption algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptanalysis of `less short' RSA secret exponents
• Kloosterman double sums
• On the normal number of prime factors of \(\phi(n)\)
• On the Distribution of Diffie--Hellman Triples with Sparse Exponents
• Cryptanalysis of short RSA secret exponents
• Cryptanalysis of RSA with Private Key d Less than N 0.292
• Fractional parts of functions of a special form
• On the arithmetic structure of the integers whose sum of digits is fixed