The discrete logarithm hides O(log n) bits

The discrete log is very discreet

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

An Improved Pseudo-random Generator Based on Discrete Log

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology

Hidden Number Problem with the Trace and Bit Security of XTR and LUC

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology

Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks (Extended Abstract)

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks

CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology

Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology

All Bits ax+b mod p are Hard (Extended Abstract)

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology

The security of all RSA and discrete log bits

Journal of the ACM (JACM)

Simultaneous Hardcore Bits and Cryptography against Memory Attacks

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography

A New Hard-Core Predicate of Paillier's Trapdoor Function

INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology

An efficient pseudo-random generator provably as secure as syndrome decoding

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Hard bits of the discrete log with applications to password authentication

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology