A hybrid algorithm for the regular syndrome decoding problem
From MaRDI portal
Cites work
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- A crossbred algorithm for solving Boolean polynomial systems
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- A simple deterministic algorithm for systems of quadratic polynomials over \(\mathbb{F}_2\)
- A Statistical Decoding Algorithm for General Linear Block Codes
- Correlated pseudorandomness from expand-accumulate codes
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- Le Mans: dynamic and fluid MPC for dishonest majority
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- LPN decoded
- On the complexity of matrix reduction over finite fields
- On the inherent intractability of certain coding problems (Corresp.)
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
- Progress in Cryptology – Mycrypt 2005
- Short signatures from regular syndrome decoding in the head
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- The polynomial method in circuit complexity applied to algorithm design (invited talk)
- TinyKeys: a new approach to efficient multi-party computation
This page was built for publication: A hybrid algorithm for the regular syndrome decoding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232547)
