The Use of the Direct Sum Decomposition Algorithm for Analyzing the Strength of Some Mceliece Type Cryptosystems

DOI10.14529/mmp190308zbMath1427.68076OpenAlexW2998914584MaRDI QIDQ5212525

V. M. Deundyak, Yury V. Kosolapov

Publication date: 29 January 2020

Published in: Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software" (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/vyuru507

zbMATH Keywords

attack on keyMcEliece-type cryptosystemdirect sum of codes

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (2)

IND-CCA2 secure McEliece-type modification in the standard model ⋮ On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• On the concatenated structure of a linear code
• On automorphisms of linear codes over a prime field
• Effective attack on the McEliece cryptosystem based on Reed-Muller codes
• Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
• A public-key cryptosystem based on binary Reed-Muller codes
• On the edge-independence number and edge-covering number for regular graphs
• The category of linear codes
• On the Berger - Loidreau Cryptosystem on the Tensor Product of Codes
• Cryptanalysis of the Sidelnikov Cryptosystem

This page was built for publication: The Use of the Direct Sum Decomposition Algorithm for Analyzing the Strength of Some Mceliece Type Cryptosystems