Stationary syndrome decoding for improved PCGs
From MaRDI portal
Cites work
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- A Statistical Decoding Algorithm for General Linear Block Codes
- Algebraic coding theory
- Analytic combinatorics
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Authenticated garbling from simple correlations
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Constructions of low-degree and error-correcting -biased generators
- Correlated pseudorandomness from expand-accumulate codes
- Decoding linear codes with high error rate and its impact for LPN security
- 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 for any finite field
- 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
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem
- Noise-tolerant learning, the parity problem, and the statistical query model
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- On computing nearest neighbors with applications to decoding of binary linear codes
- Progress in Cryptology – Mycrypt 2005
- Pseudorandom functions: three decades later
- Security bounds for the design of code-based cryptosystems
- Short signatures from regular syndrome decoding in the head
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Smaller decoding exponents: ball-collision decoding
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- Sok: vector OLE-based zero-knowledge protocols
- Solving sparse linear equations over finite fields
- Stationary syndrome decoding for improved PCGs
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- The Magma algebra system. I: The user language
- TinyKeys: a new approach to efficient multi-party computation
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
Cited in
(2)
This page was built for publication: Stationary syndrome decoding for improved PCGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864045)
