Pages that link to "Item:Q4303931"

The following pages link to On the edge-independence number and edge-covering number for regular graphs (Q4303931):

Displaying 50 items.

• Enhanced public key security for the McEliece cryptosystem (Q271573) (← links)
• A characterization of MDS codes that have an error correcting pair (Q285480) (← links)
• Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension (Q310244) (← links)
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes (Q398980) (← links)
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (Q626942) (← links)
• Cryptanalysis of a system based on twisted Reed-Solomon codes (Q780371) (← links)
• Power error locating pairs (Q782853) (← links)
• Cryptanalysis of the Matsumoto and Imai public key scheme of EUROCRYPT '98 (Q1580542) (← links)
• Extension of Overbeck's attack for Gabidulin-based cryptosystems (Q1696047) (← links)
• Cryptanalysis of the Wu-Dawson public key cryptosystem (Q1808848) (← links)
• Mathematical problems in cryptology (Q1910812) (← links)
• The non-gap sequence of a subcode of a generalized Reed-Solomon code (Q1934242) (← links)
• Encryption scheme based on expanded Reed-Solomon codes (Q2025358) (← links)
• Classification of Hadamard products of one-codimensional subcodes of Reed-Muller codes (Q2081012) (← links)
• Security analysis of a cryptosystem based on subspace subcodes (Q2163762) (← links)
• Performance bounds for QC-MDPC codes decoders (Q2163766) (← links)
• Reproducible families of codes and cryptographic applications (Q2239799) (← links)
• Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice (Q2384012) (← links)
• On the unique representation of very strong algebraic geometry codes (Q2436568) (← links)
• Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
• Effective attack on the McEliece cryptosystem based on Reed-Muller codes (Q2629742) (← links)
• ECC\(^2\): error correcting code and elliptic curve based cryptosystem (Q2663594) (← links)
• Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece'' hardware reference implementation (Q2692373) (← links)
• Square Code Attack on a Modified Sidelnikov Cryptosystem (Q2947081) (← links)
• Monoidic Codes in Cryptography (Q3102791) (← links)
• Quantum Resistant Public Key Encryption Scheme polarRLCE (Q3294872) (← links)
• Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes (Q3460457) (← links)
• Attacking and Defending the McEliece Cryptosystem (Q3535349) (← links)
• Reducing Key Length of the McEliece Cryptosystem (Q3637133) (← links)
• Code-Based Cryptosystems Using Generalized Concatenated Codes (Q4610024) (← links)
• How to avoid the Sidel'nikov-Shestakov attack (Q4637800) (← links)
• On the Berger - Loidreau Cryptosystem on the Tensor Product of Codes (Q4972204) (← links)
• Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes (Q5066537) (← links)
• A Graph-Theoretical Method for Decoding Some Group MLD-Codes (Q5090151) (← links)
• (Q5110100) (← links)
• The Use of the Direct Sum Decomposition Algorithm for Analyzing the Strength of Some Mceliece Type Cryptosystems (Q5212525) (← links)
• On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes (Q5871426) (← links)
• Revisiting algebraic attacks on MinRank and on the rank decoding problem (Q6063136) (← links)
• Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems (Q6112240) (← links)
• Breaking Goppa-based McEliece with hints (Q6116182) (← links)
• Distinguishing and recovering generalized linearized Reed-Solomon codes (Q6132742) (← links)
• Decoding McEliece with a hint -- secret Goppa key parts reveal everything (Q6134806) (← links)
• The syndromes decoding algorithm in group codes (Q6156920) (← links)
• On new problems in asymmetric cryptography based on error-resistant coding (Q6173457) (← links)
• Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem (Q6174648) (← links)
• Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes (Q6550574) (← links)
• \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM} (Q6550587) (← links)
• Blockwise rank decoding problem and LRPC codes: cryptosystems with smaller sizes (Q6595927) (← links)
• Two modifications for Loidreau's code-based cryptosystem (Q6602397) (← links)
• A new approach based on quadratic forms to attack the McEliece cryptosystem (Q6604863) (← links)