On lower bounds for information set decoding over F_q and on the effect of partial knowledge
From MaRDI portal
Publication:2363734
DOI10.1504/IJICOT.2017.10002266zbMATH Open1405.94134MaRDI QIDQ2363734FDOQ2363734
Authors: Robert Niebuhr, Edoardo Persichetti, Pierre-Louis Cayrel, Stanislav Bulygin, Johannes Buchmann 
Publication date: 26 July 2017
Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)
Recommendations
- Information-set decoding for linear codes over \(\mathbb F_q\)
- Information-set decoding with hints
- Improved information set decoding for code-based cryptosystems with constrained memory
- Analysis of information set decoding for a sub-linear error weight
- Security bounds for the design of code-based cryptosystems
lower boundscodessecuritypost-quantum cryptographyattackscryptosystemspartial knowledgeinformation set decodingISD
Cited In (19)
- Information set decoding in the Lee metric with applications to cryptography
- Attacking code-based cryptosystems with information set decoding using special-purpose hardware
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- On the design and security of Lee metric McEliece cryptosystems
- Analysis of information set decoding for a sub-linear error weight
- Generalization of the ball-collision algorithm
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Encryption scheme based on expanded Reed-Solomon codes
- Security bounds for the design of code-based cryptosystems
- Information-set decoding for linear codes over \(\mathbb F_q\)
- S-semantics -- an example
- Information-set decoding with hints
- On the hardness of the Lee syndrome decoding problem
- Improved information set decoding for code-based cryptosystems with constrained memory
- DAGS: key encapsulation using dyadic GS codes
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems
- Optimizing information set decoding algorithms to attack cyclosymmetric MDPC codes
- Improved information set decoding algorithms over Galois ring in the Lee metric
This page was built for publication: On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363734)
