Worst-case subexponential attacks on PRGs of constant degree or constant locality
From MaRDI portal
Publication:6138077
DOI10.1007/978-3-031-30545-0_2zbMath1530.94046OpenAlexW4365935736MaRDI QIDQ6138077
Publication date: 16 January 2024
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30545-0_2
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Secure arithmetic computation with constant computational overhead
- On the concrete security of Goldreich's pseudorandom generator
- Solving degree, last fall degree, and related invariants
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Solving multivariate polynomial systems and an invariant from commutative algebra
- Sum-of-squares meets program obfuscation, revisited
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Solving Degree and Degree of Regularity for Polynomial Systems over a Finite Fields
- The Degree of Regularity of HFE Systems
- Candidate One-Way Functions Based on Expander Graphs
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- On the Security of Goldreich’s One-Way Function
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- A Pseudorandom Generator from any One-way Function
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Solving Quadratic Equations with XL on Parallel Architectures
- Cryptographic Hardness of Random Local Functions–Survey
- Advances in Cryptology - EUROCRYPT 2004
- Algebraic attacks against random local functions and their countermeasures
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- All in the XL Family: Theory and Practice
- The XL-Algorithm and a Conjecture from Commutative Algebra
- Comparison Between XL and Gröbner Basis Algorithms
- Indistinguishability obfuscation from well-founded assumptions
This page was built for publication: Worst-case subexponential attacks on PRGs of constant degree or constant locality
