On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
From MaRDI portal
Publication:2363734
DOI10.1504/IJICOT.2017.10002266zbMath1405.94134MaRDI QIDQ2363734
Robert Niebuhr, Stanislav Bulygin, Pierre-Louis Cayrel, Edoardo Persichetti, Johannes A. Buchmann
Publication date: 26 July 2017
Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)
securitylower boundsattackscodespost-quantum cryptographycryptosystemspartial knowledgeinformation set decodingISD
Related Items (13)
Information set decoding in the Lee metric with applications to cryptography ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Generalization of the Ball-Collision Algorithm ⋮ Information-set decoding with hints ⋮ 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 ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ DAGS: key encapsulation using dyadic GS 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 ⋮ On the design and security of Lee metric McEliece cryptosystems
This page was built for publication: On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
