Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
From MaRDI portal
Publication:4639475
DOI10.1007/978-3-662-52993-5_8zbMath1387.94100OpenAlexW2497867845MaRDI QIDQ4639475
Publication date: 9 May 2018
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-52993-5_8
multiplicative complexityS-boxSAT solverscircuit depth complexityimplementation optimizationshortest linear straight-line program
Related Items (11)
Investigation for 8-bit \textsc{SKINNY}-like S-boxes, analysis and applications ⋮ A framework to optimize implementations of matrices ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ \textsc{Ascon} v1.2: lightweight authenticated encryption and hashing ⋮ Tornado: automatic generation of probing-secure masked bitsliced implementations
Uses Software
Cites Work
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Hypothesis testing and advanced distinguishers in differential cryptanalysis of block ciphers
- Heuristic Tool for Linear Cryptanalysis with Applications to CAESAR Candidates
- Ciphers for MPC and FHE
- Piccolo: An Ultra-Lightweight Blockcipher
- The Complexity of Boolean Formula Minimization
- On the Shortest Linear Straight-Line Program for Computing Linear Forms
- Keccak
- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
- ICEPOLE: High-Speed, Hardware-Oriented Authenticated Encryption
This page was built for publication: Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
