The Viterbi decoding complexity of linear block codes [PDF]
, 1994 A given linear block code can be represented by many different trellises. In this paper, we will show that if these trellises are scored according to the complexity of implementing the Viterbi decoding algorithm on them, there is a uniquely optimal one ...
McEliece, Robert J.
core
Cryptanalysis of the Original McEliece Cryptosystem [PDF]
, 2000 The class of public-key cryptosystems based on error-correcting codes is one of the few alternatives to the common algorithms based on number theory. We here present an attack against these systems which actually consists of a new probabilistic algorithm for finding minimum-weight words in any large linear code.
Anne Canteaut, Nicolas Sendrier
openaire +1 more source
, 2015 In this paper, we consider a zero error coordination problem wherein the nodes of a network exchange messages to be able to perfectly coordinate their actions with the individual observations of each other.
Abroshan, Mahed +2 more
core +1 more source
Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and their subcodes
, 2016 We give polynomial time attacks on the McEliece public key cryptosystem based either on algebraic geometry (AG) codes or on small codimensional subcodes of AG codes.
Couvreur, Alain +2 more
core +1 more source
Resilience Optimization of Post-Quantum Cryptography Key Encapsulation Algorithms. [PDF]
Sensors (Basel), 2023 Farooq S +6 more
europepmc +1 more source
Cryptanalysis of McEliece’s Public-Key Cryptosystem [PDF]
, 2007 An approach is proposed for the cryptanalysis of the well-known version of McEliece's public-key cryptosystem that is based on a new iterative optimization algorithm for decoding an arbitrary linear code. The algorithm provides guaranteed correction of all error patterns with Hamming weight less than d/2, where d is the minimum distance of the code ...
Valery I. Korzhik, Andrey I. Turkin
openaire +1 more source
A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem Based on Reed-Solomon Codes
, 2012 Baldi et \textit{al.} proposed a variant of McEliece's cryptosystem. The main idea is to replace its permutation matrix by adding to it a rank 1 matrix.
Gauthier, Valérie +2 more
core +1 more source
New Set of Codes for the Maximum-Likelihood Decoding Problem [PDF]
, 2010 The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes. In this paper, we introduce the notion of A-covered codes, that is, codes that can be decoded through a polynomial time algorithm A whose decoding ...
Barbier, Morgan
core +3 more sources
Modelling and verification of post-quantum key encapsulation mechanisms using Maude. [PDF]
PeerJ Comput Sci, 2023 García V +4 more
europepmc +1 more source
A Programmable Crypto-Processor for National Institute of Standards and Technology Post-Quantum Cryptography Standardization Based on the RISC-V Architecture. [PDF]
Sensors (Basel), 2023 Lee J, Kim W, Kim JH.
europepmc +1 more source