Simultaneous Security of Bits in the Discrete Log

DOI10.1007/3-540-39805-8_8zbMath0589.94008OpenAlexW1573303085WikidataQ62472257 ScholiaQ62472257MaRDI QIDQ3718620

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

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

Related Items

More efficient DDH pseudorandom generators, Minimum disclosure proofs of knowledge, Paillier's trapdoor function hides \(\Theta(n)\) bits, Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography