Can we speed up information set decoding by using extension field structure?
From MaRDI portal
Cites work
- A new sieving-style information-set decoding algorithm
- Asymptotics and improvements of sieving for 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})\)
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 93751 (Why is no real title available?)
- Information-set decoding for linear codes over F_q
- Limit distribution of the minimum distance of random linear codes
- New generic algorithms for hard knapsacks
- On computing nearest neighbors with applications to decoding of binary linear codes
- On the Complexity of the Rank Syndrome Decoding Problem
- On the inherent intractability of certain coding problems (Corresp.)
- Random codes: minimum distances and error exponents
- Reduction from sparse LPN to LPN, dual attack 3.0
- Revisiting nearest-neighbor-based information set decoding
- Some new NP-complete coding problems
- Statistical decoding 2.0: reducing decoding to LPN
- Statistical Decoding Revisited
- Syndrome Decoding Estimator
This page was built for publication: Can we speed up information set decoding by using extension field structure?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363949)
