Simultaneous Security of Bits in the Discrete Log

DOI10.1007/3-540-39805-8_8MaRDI QIDQ3718620zbMATH OpenOpenAlexDBLPWikidataFDO

Authors René Peralta

Publication date 1986

Published in Advances in Cryptology — EUROCRYPT’ 85 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-39805-8_8

zbMATH Keywords

cryptographycryptographically secure pseudo random number generatordiscrete log functionnext-bit unpredictability condition

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• scientific article; zbMATH DE number 1302855
• scientific article; zbMATH DE number 1759796
• The Discrete Logarithm Hides $O(\log n)$ Bits
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• An improved pseudo-random generator based on the discrete logarithm problem

Cited in

(11)

• The discrete logarithm modulo a composite hides \(O(n)\) bits
• On computing discrete logarithms in bulk and randomness extractors
• Minimum disclosure proofs of knowledge
• The Discrete Logarithm Hides $O(\log n)$ Bits
• An improved pseudo-random generator based on the discrete logarithm problem
• Topics in Cryptology – CT-RSA 2005
• Paillier's trapdoor function hides \(\Theta(n)\) bits
• scientific article; zbMATH DE number 3928174 (Why is no real title available?)
• Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• More efficient DDH pseudorandom generators

This page was built for publication: Simultaneous Security of Bits in the Discrete Log

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