Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
From MaRDI portal
Publication:310244
DOI10.1007/s10623-015-0099-xzbMath1402.94064OpenAlexW641845919MaRDI QIDQ310244
Mahmoud Ahmadian-Attari, Carl Löndahl, Mohammad Reza Aref, Masoumeh Koochak Shooshtari, Thomas Johansson
Publication date: 8 September 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0099-x
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Polynomials over finite fields (11T06) Cyclic codes (94B15)
Related Items (5)
Structural cryptanalysis of McEliece schemes with compact keys ⋮ Performance bounds for QC-MDPC codes decoders ⋮ A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting ⋮ On generating invertible circulant binary matrices with a prescribed number of ones ⋮ Cryptanalysis of LEDAcrypt
Uses Software
Cites Work
- Unnamed Item
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications]
- Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Decoding One Out of Many
- Attacking and Defending the McEliece Cryptosystem
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- On the edge-independence number and edge-covering number for regular graphs
- Hardness of approximating the minimum distance of a linear code
- On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes
This page was built for publication: Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
