On lower bounds for information set decoding over F_q and on the effect of partial knowledge
Summary: Code-based cryptosystems are promising candidates for post-quantum cryptography since they are fast, require only basic arithmetic because their security is well understood. The increasing number of cryptographic schemes based on codes over fields other than \(\mathbb F_2\) presents, however, security issues that are not relevant in the case of binary codes; the security of such constructions, therefore, requires separate assessment. Information set decoding (ISD) is one of the most important generic attacks against code-based cryptosystems. We give lower bounds for ISD over \(\mathbb F_q\), thereby anticipating future software and hardware improvements. Our results allow to compute conservative parameters for cryptographic applications. While most security proofs assume that an attacker does not have any additional information about the secret, we show that in certain scenarios an attacker can gain partial knowledge of the secret. We present how this knowledge can be used to improve the efficiency of an attack and give new bounds for the complexity of such an attack. In this paper, we analyse two types of partial knowledge including concrete scenarios and give an idea how to prevent the leakage of such knowledge to an attacker.
- DAGS: key encapsulation using dyadic GS codes
- Encryption scheme based on expanded Reed-Solomon codes
- On the design and security of Lee metric McEliece cryptosystems
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Information-set decoding with hints
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- Analysis of information set decoding for a sub-linear error weight
- Attacking code-based cryptosystems with information set decoding using special-purpose hardware
- Optimizing information set decoding algorithms to attack cyclosymmetric MDPC codes
- Improved information set decoding for code-based cryptosystems with constrained memory
- Information-set decoding for linear codes over F_q
- Security bounds for the design of code-based cryptosystems
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Generalization of the ball-collision algorithm
- On the hardness of the Lee syndrome decoding problem
- S-semantics -- an example
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems
- Improved information set decoding algorithms over Galois ring in the Lee metric
- Information set decoding in the Lee metric with applications to cryptography
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)
