Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)

DOI10.1016/j.ipl.2018.04.010zbMath1487.94205OpenAlexW2801742862WikidataQ93163943 ScholiaQ93163943MaRDI QIDQ1641147

Chiara Valentina Schiavo, Andrea Visconti, René Peralta

Publication date: 15 June 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc6463526

zbMATH Keywords

linear systemscryptographydense matricesgate complexityXOR gates

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Fault detection; testing in circuits and networks (94C12)

Related Items (5)

A framework to optimize implementations of matrices ⋮ A new matrix form to generate all \(3\times 3\) involutory MDS matrices over \(\mathbb{F}_{2^m}\) ⋮ Four by four MDS matrices with the fewest XOR gates based on words ⋮ Construction of lightweight involutory MDS matrices ⋮ New records of pre-image search of reduced SHA-1 using SAT solvers

Cites Work

• Unnamed Item
• Unnamed Item
• Cancellation-free circuits in unbounded and bounded depth
• Logic minimization techniques with applications to cryptology
• A Very Compact S-Box for AES
• Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
• Contributions à l'étude de quelques points de la théorie de R. P. Feynman

This page was built for publication: Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)