On generating invertible circulant binary matrices with a prescribed number of ones
From MaRDI portal
Publication:680936
DOI10.1007/S12095-017-0239-4zbMATH Open1384.94061OpenAlexW2734387672MaRDI QIDQ680936FDOQ680936
Authors: Tomáš Fabšič, Otokar Grošek, Karol Nemoga, Pavol Zajac
Publication date: 29 January 2018
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-017-0239-4
Recommendations
- Invertible matrices over some quotient rings: identification, generation, and analysis
- Publication:4487996
- On circulant involutory MDS matrices
- The inverse of circulant matrices over \(\mathrm{GF}(2^m )\)
- Retracted: Invertible matrices over some quotient rings: identification, generation, and analysis
circulant matricesinvertible matricesbinary matrices with a prescribed number of onesQC-LDPC McEliece cryptosystem
Cites Work
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Title not available (Why is that?)
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Title not available (Why is that?)
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Some results on quasi-cyclic codes
- Title not available (Why is that?)
- Towards Side-Channel Resistant Implementations of QC-MDPC McEliece Encryption on Constrained Devices
Cited In (4)
Uses Software
This page was built for publication: On generating invertible circulant binary matrices with a prescribed number of ones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680936)