On the concrete security of Goldreich's pseudorandom generator

DOI10.1007/978-3-030-03329-3_4zbMath1446.94120OpenAlexW2898600488MaRDI QIDQ1710593

Aurélien Dupin, Mélissa Rossi, Pierrick Méaux, Yann Rotella, Geoffroy Couteau

Publication date: 23 January 2019

Full work available at URL: https://hal.inria.fr/hal-01944772/file/goldreicheprint.pdf

zbMATH Keywords

Gröbner basispseudorandom generatorsalgebraic attacksguess-and-determine

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10)

Related Items

MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Improved filter permutators for efficient FHE: better instances and implementations ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Worst-case subexponential attacks on PRGs of constant degree or constant locality ⋮ Oblivious transfer with constant computational overhead ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Indistinguishability obfuscation ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Non-interactive zero-knowledge in pairing-free groups from weaker assumptions ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification

This page was built for publication: On the concrete security of Goldreich's pseudorandom generator