Small low-depth circuits for cryptographic applications

DOI10.1007/S12095-018-0296-3zbMath1420.94121DBLPjournals/ccds/BoyarFP19OpenAlexW2793458514WikidataQ62472208 ScholiaQ62472208MaRDI QIDQ1755189

René Peralta, Magnus Gausdal Find, Joan. Boyar

Publication date: 8 January 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

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

zbMATH Keywords

Boolean functionscircuit depthcircuit sizecryptographic functionsdepth-constrained circuit optimizationsee-saw method

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

On the construction of \(4 \times 4\) lightweight involutory MDS matrices over \(\mathbb{F}_{2^8}\) ⋮ Implementing Grover oracles for quantum key search on AES and LowMC

Cites Work

• Unnamed Item
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• Cancellation-free circuits in unbounded and bounded depth
• Logic minimization techniques with applications to cryptology
• Pushing the Limits: A Very Compact and a Threshold Implementation of AES
• Mixed Bases for Efficient Inversion in ${{\mathbb F}{((2^2)^2)}{2}}$ and Conversion Matrices of SubBytes of AES

This page was built for publication: Small low-depth circuits for cryptographic applications