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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on computers Vol. 73; no. 8; pp. 2036 - 2050
Main Authors:	Jeon, Yongjin, Baek, Seungjun, Kim, Jongsung
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.08.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!