Constructing S-boxes for Lightweight Cryptography with Feistel Structure

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Workshop on Cryptographic Hardware and Embedded Systems

• Publication date

  2014-09-23

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-44709-3_8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Arithmetic of Finite Fields: 6th International Workshop, WAIFI 2016, Ghent, Belgium, July 13-15, 2016, Revised Selected Papers

  2016cited by this paper
• LS-Designs: Bitslice Encryption for Efficient Masked Software Implementations

  2014cited by this paper
• Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions

  2012cited by this paper
• The PHOTON Family of Lightweight Hash Functions

  2011cited by this paper
• Piccolo: An Ultra-Lightweight Blockcipher

  2011cited by this paper
• A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework

  2011cited by this paper
• The LED Block Cipher

  2011cited by this paper
• Cryptographic Hardware and Embedded Systems - CHES 2011 - 13th International Workshop, Nara, Japan, September 28 - October 1, 2011. Proceedings

  2011cited by this paper
• Boolean Models and Methods in Mathematics, Computer Science, and Engineering: Boolean Functions for Cryptography and Error-Correcting Codes

  2010cited by this paper
• On differential uniformity and nonlinearity of functions

  2009cited by this paper
• On the Classification of 4 Bit S-Boxes

  2007influential reference
• Cryptographic hardware and embedded systems : CHES 2007 : 9th International Workshop, Vienna, Austria, September 10-13, 2007 : proceedings

  2007cited by this paper
• PRESENT: An Ultra-Lightweight Block Cipher

  2007cited by this paper
• Vectorial Boolean Functions for Cryptography

  2006cited by this paper
• Affinity of permutations of P2n

  2006cited by this paper
• Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop, Edinburgh, UK, August 29 - September 1, 2005, Proceedings

  2005cited by this paper
• A Very Compact S-Box for AES

  2005cited by this paper
• New classes of almost bent and almost perfect nonlinear polynomials

  2005cited by this paper
• Fast Software Encryption

  2002cited by this paper
• Polynomial Reconstruction Based Cryptography

  2001cited by this paper
• Advances in Cryptology — EUROCRYPT ’93

  2001cited by this paper
• Advances in Cryptology — CRYPTO’ 92

  2001cited by this paper
• One-to-One Highly Nonlinear Power Functions on GF(2n)

  1998cited by this paper
• CRYPTON: A New 128-bit Block Cipher - Specification and Analysis

  1998influential reference
• On Maximum Non-averaged Differential Probability

  1998cited by this paper
• Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems

  1998cited by this paper
• CS-Cipher

  1998cited by this paper
• New Block Encryption Algorithm MISTY

  1997cited by this paper
• New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis

  1996cited by this paper
• Links Between Differential and Linear Cryptanalysis

  1994cited by this paper
• Differentially Uniform Mappings for Cryptography

  1994cited by this paper
• Advances in Cryptology — EUROCRYPT'94

  1994cited by this paper
• Provable Security Against Differential Cryptanalysis

  1992cited by this paper
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)

  1968cited by this paper

• Construction of Lightweight S-Boxes With Low Boomerang Uniformity

  2026cites this paper
• A 10-bit S-box generated by Feistel construction from cellular automata

  2025cites this paper
• Lightweight 6-bit S-Boxes With DPA Resistance

  2025cites this paper
• Compact 8-Bit S-Boxes Based on Multiplication in a Galois Field GF(24)

  2025cites this paper
• Technology-Dependent Synthesis and Optimization of Circuits for Small S-boxes

  2025cites this paper
• How Small Can S-boxes Be

  2025cites this paper
• Constructing 8 × 8 S-Boxes with Optimal Boolean Function Nonlinearity

  2025cites this paper
• On the construction of ultra-light MDS matrices

  2024cites this paper
• A further study on bridge structures and constructing bijective S-boxes for low-latency masking

  2023influential citation
• New Genetic Operators for Searching for S-Boxes with Low Boomerang Uniformity

  2022cites this paper
• A comprehensive analysis of lightweight 8-bit sboxes from iterative structures

  2022cites this paper
• A New Method for Designing Lightweight S-Boxes With High Differential and Linear Branch Numbers, and its Application

  2021cites this paper
• On cryptographic properties of (n + 1)-bit S-boxes constructed by known n-bit S-boxes

  2020cites this paper
• Low AND Depth and Efficient Inverses: a Guide on S-boxes for Low-latency Masking

  2020cites this paper
• Partitions in the S-Box of Streebog and Kuznyechik

  2019cites this paper
• Multiset Structural Attack on Generalized Feistel Networks

  2019cites this paper
• We also use “ + ” and “ − ” to denote integer addition and substration , and “ ⊕ ”

  2019cites this paper
• Lightweight Involutive Components for Symmetric Cryptography

  2019cites this paper
• If a generalised butterfly is APN then it operates on 6 bits

  2019cites this paper
• On the Generalization of Butterfly Structure

  2018cites this paper
• The Cryptographic Properties of Feistel Network-Based Quasigroups

  2018cites this paper
• MDS Matrices with Lightweight Circuits

  2018cites this paper
• A Complete Permutation Over GF(2$^{2m}$) With Easy Hardware Implementation and the Best Known Cryptography Properties

  2017cites this paper
• Differentially 4-Uniform Permutations with the Best Known Nonlinearity from Butterflies

  2017influential citation
• Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds

  2017cites this paper
• A Generalisation of Dillon's APN Permutation With the Best Known Differential and Nonlinear Properties for All Fields of Size $2^{4k+2}$

  2017influential citation
• Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem

  2016cites this paper
• Further Results of the Cryptographic Properties on the Butterfly Structure

  2016influential citation
• Real-time decomposition of three kinds of structural S-boxes

  2016cites this paper
• Construction of Lightweight S-Boxes Using Feistel and MISTY Structures

  2015influential citation
• Constructing Lightweight Optimal Diffusion Primitives with Feistel Structure

  2015cites this paper
• DOCTEUR DE L'UNIVERSITÉ DU LUXEMBOURG EN INFORMATIQUE

  2014cites this paper