On the design and security of Lee metric McEliece cryptosystems

DOI10.1007/S10623-021-01002-2zbMATH Open1485.94105OpenAlexW4205570698WikidataQ114849801 ScholiaQ114849801MaRDI QIDQ2115742FDOQ2115742

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

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

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)

Cites Work

• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Information-set decoding for linear codes over \(\mathbb F_q\)
• Title not available (Why is that?)
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• Title not available (Why is that?)
• Smaller decoding exponents: ball-collision decoding
• On the inherent intractability of certain coding problems (Corresp.)
• On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
• On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
• A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
• Generalization of the Ball-Collision Algorithm
• Information set decoding in the Lee metric with applications to cryptography
• 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$$
• Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes

Cited In (2)

• Information set decoding for Lee-metric codes using restricted balls
• Designing a Rank Metric Based McEliece Cryptosystem

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)