A Search Strategy to Optimize the Affine Variant Properties of S-Boxes

DOI10.1007/978-3-319-55227-9_15zbMath1409.94899OpenAlexW2563397511MaRDI QIDQ5267803

Bohan Yang, Nele Mentens, Stjepan Picek

Publication date: 13 June 2017

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55227-9_15

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• PRESENT
• spongent
• NOEKEON
• Keccak
• PRINCE
• Piccolo
• Midori

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Midori: A Block Cipher for Low Energy
• Cryptographic Analysis of All 4 × 4-Bit S-Boxes
• Differential Power Analysis in Hamming Weight Model: How to Choose among (Extended) Affine Equivalent S-boxes
• Confused by Confusion: Systematic Evaluation of DPA Resistance of Various S-boxes
• A New Classification of 4-bit Optimal S-boxes and Its Application to PRESENT, RECTANGLE and SPONGENT
• On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
• Piccolo: An Ultra-Lightweight Blockcipher
• PRESENT: An Ultra-Lightweight Block Cipher
• Perfect nonlinear S-boxes
• A Statistical Model for DPA with Novel Algorithmic Confusion Analysis
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• Keccak
• DPA Resilience of Rotation-Symmetric S-boxes
• On the Classification of 4 Bit S-Boxes
• Fast Software Encryption
• Introduction to evolutionary computing