Improved information set decoding for code-based cryptosystems with constrained memory
From MaRDI portal
Recommendations
- Analysis of information set decoding for a sub-linear error weight
- Quantum information set decoding algorithms
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- Information-set decoding for linear codes over F_q
- Attacking code-based cryptosystems with information set decoding using special-purpose hardware
Cites work
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- A low-memory algorithm for finding short product representations in finite groups.
- A space-time tradeoff for permutation problems
- A tutorial on high performance computing applied to cryptanalysis. (Invited talk abstract)
- Algebraic cryptanalysis of McEliece variants with compact keys
- Attacking and Defending the McEliece Cryptosystem
- 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 Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Improved Generic Algorithms for Hard Knapsacks
- New generic algorithms for hard knapsacks
- On computing nearest neighbors with applications to decoding of binary linear codes
- On lattices, learning with errors, random linear codes, and cryptography
- On the inherent intractability of certain coding problems (Corresp.)
- Open problems around exact algorithms
- Parallel collision search with cryptanalytic applications
- SWIFFT: A Modest Proposal for FFT Hashing
- Security bounds for the design of code-based cryptosystems
- Smaller decoding exponents: ball-collision decoding
- Space-time tradeoffs for subset sum: an improved worst case algorithm
- The Factorization of the Ninth Fermat Number
Cited in
(11)- Attacking code-based cryptosystems with information set decoding using special-purpose hardware
- Analysis of information set decoding for a sub-linear error weight
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Revisiting nearest-neighbor-based information set decoding
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- Quantum information set decoding algorithms
- Information-set decoding for linear codes over F_q
- Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
- Concrete time/memory trade-offs in generalised Stern's ISD algorithm
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- Interleaved Prange: a new generic decoder for interleaved codes
This page was built for publication: Improved information set decoding for code-based cryptosystems with constrained memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452571)
