On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure

DOI10.1007/978-3-662-47989-6_6zbMath1347.94019OpenAlexW1889322616MaRDI QIDQ3457107

Léo Perrin, Alex Biryukov

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47989-6_6

zbMATH Keywords

linearityefficient implementationfunctional decomposition problemS-box design criteriaskipjack

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

An improved affine equivalence algorithm for random permutations ⋮ Efficient slide attacks ⋮ Boomerang uniformity of popular S-box constructions ⋮ Algebraic Insights into the Secret Feistel Network ⋮ Cryptanalysis of Feistel Networks with Secret Round Functions ⋮ Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem

Uses Software

• SageMath
• CLEFIA
• Whirlpool
• SIMECK
• SIMON

Cites Work

• Differential properties of power functions
• An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
• Differential cryptanalysis of DES-like cryptosystems
• Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials
• Perfect nonlinear functions and cryptography
• Block Ciphers That Are Easier to Mask: How Far Can We Go?
• The Round Functions of RIJNDAEL Generate the Alternating Group
• The 128-Bit Blockcipher CLEFIA (Extended Abstract)
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• The Data Encryption Standard (DES) and its strength against attacks
• SAFER K-64: A byte-oriented block-ciphering algorithm
• Probability distributions of correlation and differentials in block ciphers
• On the structure of Skipjack

This page was built for publication: On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure