All Bits in ax + b mod p are Hard

DOI10.1007/3-540-68697-5_10zbMath1329.94074OpenAlexW10922151MaRDI QIDQ3452346

Mats Näslund

Publication date: 11 November 2015

Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68697-5_10

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Bit Security of the CDH Problems over Finite Fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• The discrete logarithm modulo a composite hides \(O(n)\) bits
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Simple Unpredictable Pseudo-Random Number Generator
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• The Discrete Logarithm Hides $O(\log n)$ Bits