On the soundness of algebraic attacks against code-based assumptions
From MaRDI portal
Cites work
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- A probabilistic remark on algebraic program testing
- An inequality for Hilbert series of graded algebras.
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Generic sequences of polynomials
- Hardness of SIS and LWE with small parameters
- Hilbert series for ideals generated by generic forms
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Indistinguishability obfuscation from bilinear maps and LPN variants
- New Algorithms for Learning in Presence of Errors
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- On the existence of homogeneous semi-regular sequences in \(\mathbb{F}_2[X_1,\ldots,X_n]/(X_1^2,\ldots,X_n^2)\)
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
- Pseudorandom functions and lattices
- Revisiting the hardness of binary error LWE
- Short signatures from regular syndrome decoding in the head
- The complexity of algebraic algorithms for LWE
- The hardness of LPN over any integer ring and field for PCG applications
- TinyKeys: a new approach to efficient multi-party computation
This page was built for publication: On the soundness of algebraic attacks against code-based assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891205)
