Simultaneous security of bits in the discrete log

Authors:
R Peralta
Affiliations:
-
Venue:
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Year:
1986

Citing 5
Cited 12

How discreet is the discrete log?

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The security of bits in the discrete logarithm

The security of bits in the discrete logarithm
How to generate cryptographically strong sequences of pseudo random bits

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Efficient And Secure Pseudo-Random Number Generation

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Conditionally secure secret sharing schemes with disenrollment capability

CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Parallel exponentiators using data signal processor chips and transputers for a flexible and efficient software implementation of public-key cryptosystems to run on PC's or larger systems

ACM SIGSAC Review
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
The security of all RSA and discrete log bits

Journal of the ACM (JACM)
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
More efficient DDH pseudorandom generators

Designs, Codes and Cryptography
Group signatures

EUROCRYPT'91 Proceedings of the 10th 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
Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that c log log P simultaneously secure bits can be extracted from the discrete log function. These bits satisfy the next-bit unpredictability condition of Blum and Micali. Therefore we can construct a cryptographically secure pseudo random number generator which produces c log log P bits per modular exponentiation under the assumption that the discrete log is hard.