On the edge-independence number and edge-covering number for regular graphs
From MaRDI portal
Publication:4303931
DOI10.1515/dma.1992.2.1.1zbMath0796.94006OpenAlexW2089257943MaRDI QIDQ4303931
S. O. Shestakov, V. M. Sidel'nikov
Publication date: 7 September 1994
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.1992.2.1.1
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60) Cyclic codes (94B15)
Related Items
Enhanced public key security for the McEliece cryptosystem, A characterization of MDS codes that have an error correcting pair, Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension, Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes, Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes, Mathematical problems in cryptology, Security analysis of a cryptosystem based on subspace subcodes, Performance bounds for QC-MDPC codes decoders, ECC\(^2\): error correcting code and elliptic curve based cryptosystem, A Graph-Theoretical Method for Decoding Some Group MLD-Codes, Square Code Attack on a Modified Sidelnikov Cryptosystem, Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes, The non-gap sequence of a subcode of a generalized Reed-Solomon code, Revisiting algebraic attacks on MinRank and on the rank decoding problem, Breaking Goppa-based McEliece with hints, Distinguishing and recovering generalized linearized Reed-Solomon codes, Decoding McEliece with a hint -- secret Goppa key parts reveal everything, Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes, Extension of Overbeck's attack for Gabidulin-based cryptosystems, The syndromes decoding algorithm in group codes, On new problems in asymmetric cryptography based on error-resistant coding, Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem, Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation, On the unique representation of very strong algebraic geometry codes, Computational aspects of retrieving a representation of an algebraic geometry code, Code-Based Cryptosystems Using Generalized Concatenated Codes, Attacking and Defending the McEliece Cryptosystem, Quantum Resistant Public Key Encryption Scheme polarRLCE, How to avoid the Sidel'nikov-Shestakov attack, Reproducible families of codes and cryptographic applications, Encryption scheme based on expanded Reed-Solomon codes, Unnamed Item, The Use of the Direct Sum Decomposition Algorithm for Analyzing the Strength of Some Mceliece Type Cryptosystems, On the Berger - Loidreau Cryptosystem on the Tensor Product of Codes, Reducing Key Length of the McEliece Cryptosystem, Monoidic Codes in Cryptography, Cryptanalysis of a system based on twisted Reed-Solomon codes, Classification of Hadamard products of one-codimensional subcodes of Reed-Muller codes, Power error locating pairs, On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes
