A probabilistic algorithm for computing minimum weights of large error-correcting codes
From MaRDI portal
Publication:3818991
DOI10.1109/18.21270zbMath0666.94017OpenAlexW2093465763MaRDI QIDQ3818991
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.21270
Related Items
Structural cryptanalysis of McEliece schemes with compact keys, Cyclic codes with generalized cyclotomic cubic classes, Information set decoding in the Lee metric with applications to cryptography, A Summary of McEliece-Type Cryptosystems and their Security, Improved identification schemes based on error-correcting codes, Structural properties of self-dual monomial codes with application to code-based cryptography, Generalization of the Ball-Collision Algorithm, On the hardness of the Lee syndrome decoding problem, An algorithm for generalized syndrome decoding problem, Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems, Attacking Reduced Round SHA-256, Improved information set decoding algorithms over Galois ring in the Lee metric, Five infinite families of binary cyclic codes and their related codes with good parameters, Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes, Parameters of several families of binary duadic codes and their related codes, Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems, Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation, A new algorithm for finding minimum-weight words in large linear codes, Cryptanalysis of Harari's identification scheme, Attacking and Defending the McEliece Cryptosystem, Faster 2-Regular Information-Set Decoding, Reproducible families of codes and cryptographic applications, Permutation group algorithms based on partitions. I: Theory and algorithms, Really Fast Syndrome-Based Hashing, TinyKeys: a new approach to efficient multi-party computation, 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, A method for efficiently computing the number of codewords of fixed weights in linear codes, Semantic security for the McEliece cryptosystem without random oracles, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Reducing Key Length of the McEliece Cryptosystem, Decoding One Out of Many, Cryptanalysis of LEDAcrypt, On the design and security of Lee metric McEliece cryptosystems
