Logic minimization techniques with applications to cryptology
From MaRDI portal
Publication:2377070
DOI10.1007/s00145-012-9124-7zbMath1279.94056OpenAlexW2003858108WikidataQ62472214 ScholiaQ62472214MaRDI QIDQ2377070
Philip Matthews, René Peralta, Joan. Boyar
Publication date: 27 June 2013
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-012-9124-7
circuit complexityS-boxAESlinear component minimizationmultiplicatice complexityShort Linear Program
Related Items
Investigation for 8-bit \textsc{SKINNY}-like S-boxes, analysis and applications, Separating OR, SUM, and XOR circuits, A framework to optimize implementations of matrices, SAT-Based Formula Simplification, Atomic-AES: A Compact Implementation of the AES Encryption/Decryption Core, Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\), More accurate division property propagations based on optimized implementations of linear layers, Differential uniformity and linearity of S-boxes by multiplicative complexity, Construction of MDS matrices combining the Feistel, Misty and Lai-Massey schemes, A new matrix form to generate all \(3\times 3\) involutory MDS matrices over \(\mathbb{F}_{2^m}\), The Multiplicative Complexity of Boolean Functions on Four and Five Variables, Spin me right round rotational symmetry for FPGA-specific AES: extended version, Improved heuristics for low-latency implementations of linear layers, Introducing a new connection between the entries of MDS matrices constructed by generalized Cauchy matrices in \(GF(2^q)\), Construction of recursive MDS matrices using DLS matrices, On construction of lightweight MDS matrices, MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity, How fast can SM4 be in software?, Four by four MDS matrices with the fewest XOR gates based on words, An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions, A First-Order SCA Resistant AES Without Fresh Randomness, Small low-depth circuits for cryptographic applications, How Fast Can Higher-Order Masking Be in Software?, Construction of lightweight involutory MDS matrices, Unnamed Item, On the construction of \(4 \times 4\) lightweight involutory MDS matrices over \(\mathbb{F}_{2^8}\), Some efficient quantum circuit implementations of Camellia, Cancellation-free circuits in unbounded and bounded depth
Cites Work
- Tight bounds for the multiplicative complexity of symmetric functions
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Optimization, approximation, and complexity classes
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Proof verification and the hardness of approximation problems
- Tensor rank is NP-complete
- Improved Garbled Circuit: Free XOR Gates and Applications
- A Very Compact S-Box for AES
- On the power of unique 2-prover 1-round games
- Mixed Bases for Efficient Inversion in ${{\mathbb F}{((2^2)^2)}{2}}$ and Conversion Matrices of SubBytes of AES
- On the Shortest Linear Straight-Line Program for Computing Linear Forms
- Faster and Timing-Attack Resistant AES-GCM
- An Algorithm for the Computation of Linear Forms
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
- An Algorithm for the Machine Calculation of Complex Fourier Series
- On the number of multiplications necessary to compute certain functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
