Small low-depth circuits for cryptographic applications
From MaRDI portal
Recommendations
- Logic minimization techniques with applications to cryptology
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
- Improved heuristics for low-latency implementations of linear layers
- A Very Compact S-Box for AES
- The multiplicative complexity of Boolean functions on four and five variables
Cites work
- scientific article; zbMATH DE number 3319974 (Why is no real title available?)
- Cancellation-free circuits in unbounded and bounded depth
- Logic minimization techniques with applications to cryptology
- Mixed bases for efficient inversion in \({\mathbb F}_{((2^2)^2)^2}\) and conversion matrices of \texttt{SubBytes} of AES
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Pushing the limits: a very compact and a threshold implementation of AES
Cited in
(12)- An EDA tool for implementation of low power and secure crypto-chips
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
- Implementing Grover oracles for quantum key search on AES and LowMC
- On the guaranteed number of activations in \(\mathsf{XS}\)-circuits
- On the bit-slice representations of some nonlinear bijective transformations
- Constructions of Iterative Near-MDS Matrices with the Lowest XOR Count
- A multi-start heuristic for multiplicative depth minimization of Boolean circuits
- Ultra-Lightweight Implementations for Smart Devices – Security for 1000 Gate Equivalents
- On the construction of \(4 \times 4\) lightweight involutory MDS matrices over \(\mathbb{F}_{2^8}\)
- Logic minimization techniques with applications to cryptology
- Designing Low-Cost Cryptographic Hardware for Wired- or Wireless Point-to-Point Connections
- Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT
This page was built for publication: Small low-depth circuits for cryptographic applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755189)
