Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes
From MaRDI portal
Publication:5066537
DOI10.14529/mmp210302zbMath1485.94100OpenAlexW4206400020MaRDI QIDQ5066537
Yury V. Kosolapov, Anastasiya Andreevna Lelyuk
Publication date: 29 March 2022
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/vyuru604
Linear codes (general theory) (94B05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Uses Software
Cites Work
- Enhanced public key security for the McEliece cryptosystem
- Classification of Hadamard products of one-codimensional subcodes of Reed-Muller codes
- Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- How to mask the structure of codes for a cryptographic use
- Effective attack on the McEliece cryptosystem based on Reed-Muller codes
- On products and powers of linear codes under componentwise multiplication
- 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
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Cryptanalysis of the Sidelnikov Cryptosystem
This page was built for publication: Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes
