Addendum to How Small Can S-boxes Be?
In ToSC 2025(1), Jia et al. proposed an SAT-aided automatic search tool for the S-box design. A part of the functionality of this tool is to search for implementations of an S-box with good area and gate-depth complexity. However, it is well-known that the gate depth complexity cannot precisely ref...
Saved in:
| Main Authors: | Yu Sun, Lixuan Wu, Chenhao Jia, Tingting Cui, Kai Hu, Meiqin Wang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ruhr-Universität Bochum
2025-06-01
|
| Series: | IACR Transactions on Symmetric Cryptology |
| Subjects: | |
| Online Access: | https://ojs.ub.rub.de/index.php/ToSC/article/view/12248 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
How Small Can S-boxes Be?
by: Chenhao Jia, et al.
Published: (2025-03-01) -
A Framework for Generating S-Box Circuits with Boyer–Peralta Algorithm-Based Heuristics, and Its Applications to AES, SNOW3G, and Saturnin
by: Yongjin Jeon, et al.
Published: (2024-12-01) -
Impossible differential distinguisher analysis of GRANULE and MANTRA algorithm
by: Xiaonian WU, et al.
Published: (2020-01-01) -
Efficient and Composable Masked AES S-Box Designs Using Optimized Inverters
by: Vedad Hadžic, et al.
Published: (2024-12-01) -
Research on Abstraction-Based Search Space Partitioning and Solving Satisfiability Problems
by: Yuexin Huang, et al.
Published: (2025-03-01)