Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
From MaRDI portal
Recommendations
- Multi-objective optimisation of bijective S-boxes
- Efficient SAT solving under assumptions
- A Search Strategy to Optimize the Affine Variant Properties of S-Boxes
- On black-box optimization in divide-and-conquer SAT solving
- Satisfiability-based algorithms for Boolean optimization
- Implementing efficient All solutions SAT solvers
- Search techniques for SAT-based Boolean optimization
- Black-box optimization in an extended search space for SAT solving
- Boosting SAT solver performance via a new hybrid approach
Cites work
- Ciphers for MPC and FHE
- Heuristic tool for linear cryptanalysis with applications to CAESAR candidates
- Hypothesis testing and advanced distinguishers in differential cryptanalysis of block ciphers
- ICEPOLE: High-Speed, Hardware-Oriented Authenticated Encryption
- Keccak
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- On the Shortest Linear Straight-Line Program for Computing Linear Forms
- Piccolo: An Ultra-Lightweight Blockcipher
- Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT
- The Complexity of Boolean Formula Minimization
Cited in
(18)- \textsc{Ascon} v1.2: lightweight authenticated encryption and hashing
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- Investigation for 8-bit \textsc{SKINNY}-like S-boxes, analysis and applications
- Thinking outside the superbox
- An STP-based model toward designing S-boxes with good cryptographic properties
- Differential uniformity and linearity of S-boxes by multiplicative complexity
- Black-box optimization in an extended search space for SAT solving
- Multi-objective optimisation of bijective S-boxes
- scientific article; zbMATH DE number 7199588 (Why is no real title available?)
- A Search Strategy to Optimize the Affine Variant Properties of S-Boxes
- A further study on bridge structures and constructing bijective S-boxes for low-latency masking
- Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
- Pushing the limits: searching for implementations with the smallest area for lightweight S-boxes
- Forced Independent Optimized Implementation of 4-Bit S-Box
- More Results on Shortest Linear Programs
- On the construction of quantum circuits for S-boxes with different criteria based on the SAT solver
- Constructing quantum implementations with the minimal T-depth or minimal width and their applications
- A framework to optimize implementations of matrices
This page was built for publication: Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639475)
