Reference : On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure |
Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
Engineering, computing & technology : Computer science | |||
http://hdl.handle.net/10993/21989 | |||
On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure | |
English | |
Biryukov, Alex ![]() | |
Perrin, Léo Paul ![]() | |
Aug-2015 | |
Advances in Cryptology -- CRYPTO 2015, | |
Gennaro, Rosario | |
Robshaw, Matthew | |
Springer-Verlag | |
Security and Cryptology, 9251 | |
116-140 | |
Yes | |
International | |
978-3-662-47989-6 | |
Berlin | |
Germany | |
35th Annual Cryptology Conference | |
August 16-20, 2015 | |
International Association for Cryptology Research | |
Santa Barbara | |
USA | |
[en] S-Box design criteria ; Skipjack ; linearity | |
[en] S-Boxes are the key components of many cryptographic primitives and designing them to improve resilience to attacks such as linear or differential cryptanalysis is well understood. In this paper, we investigate techniques that can be used to reverse-engineer S-box design and illustrate those by studying the S-Box $F$ of the Skipjack block cipher whose design process so far remained secret.
We first show that the linear properties of $F$ are far from random and propose a design criteria, along with an algorithm which generates S-Boxes very similar to that of Skipjack. Then we consider more general S-box decomposition problems and propose new methods for decomposing S-Boxes built from arithmetic operations or as a Feistel Network of up to 5 rounds. Finally, we develop an S-box generating algorithm which can fix a large number of DDT entries to the values chosen by the designer. We demonstrate this algorithm by embedding images into the visual representation of S-box's DDT. | |
Fonds National de la Recherche - FnR | |
ACRYPT | |
Researchers | |
http://hdl.handle.net/10993/21989 | |
10.1007/978-3-662-47989-6 |
File(s) associated to this reference | ||||||||||||||
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.