On the design and security of Lee metric McEliece cryptosystems

DOI10.1007/S10623-021-01002-2MaRDI QIDQ2115742zbMATHOpenAlexWikidataFDO

Authors Terry Shue Chien Lau, Chik How Tan

Publication date 21 March 2022

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-021-01002-2

zbMATH Keywords

McEliece cryptosystempublic-key encryptioncode-based cryptographycryptanalysispost-quantum cryptographyplaintext recovery attack

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)

Recommendations

• Information set decoding in the Lee metric with applications to cryptography
• Designing a Rank Metric Based McEliece Cryptosystem
• Reducing Key Length of the McEliece Cryptosystem
• Attacking and Defending the McEliece Cryptosystem
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes

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?)
• A key recovery attack on MDPC with CCA security using decoding errors
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
• Encryption scheme based on expanded Reed-Solomon codes
• Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
• Generalization of the ball-collision algorithm
• Information set decoding in the Lee metric with applications to cryptography
• Information-set decoding for linear codes over \(\mathbb F_q\)
• On computing nearest neighbors with applications to decoding of binary linear codes
• On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
• On the inherent intractability of certain coding problems (Corresp.)
• Smaller decoding exponents: ball-collision decoding

Cited in

(3)

• Information set decoding in the Lee metric with applications to cryptography
• Designing a Rank Metric Based McEliece Cryptosystem
• Information set decoding for Lee-metric codes using restricted balls

Describes a project that uses

Uses Software

• McEliece
• GitHub

This page was built for publication: On the design and security of Lee metric McEliece cryptosystems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115742)