Toward Finding S-Box Circuits With Optimal Multiplicative Complexity

In this paper, we present a new method to find S-box circuits with optimal multiplicative complexity (MC), i.e., MC-optimal S-box circuits. We provide new observations for efficiently constructing circuits and computing MC, combined with a popular pathfinding algorithm named A*. In our search, the A...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on computers Ročník 73; číslo 8; s. 2036 - 2050
Hlavní autori:	Jeon, Yongjin, Baek, Seungjun, Kim, Jongsung
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.08.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	A algorithm Algorithms Boolean functions Boxes Ciphers Circuits Complexity Complexity theory Computation Cryptography implementation Internet of Things Internet of Things (IoT) lightweight cryptography Logic gates Lower bounds MC-optimal multiplicative complexity Permutations S-box
ISSN:	0018-9340, 1557-9956
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!