Constructing lightweight optimal diffusion primitives with Feistel structure
From MaRDI portal
Publication:2807222
DOI10.1007/978-3-319-31301-6_21zbMATH Open1396.94080OpenAlexW2307673304MaRDI QIDQ2807222FDOQ2807222
Authors: Zhiyuan Guo, Wenling Wu, Si Gao 
Publication date: 19 May 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31301-6_21
Recommendations
- On Constructing of a 32 ×32 Binary Matrix as a Diffusion Layer for a 256-Bit Block Cipher
- Efficient recursive diffusion layers for block ciphers and hash functions
- On the construction of \(20 \times 20\) and \(2 4 \times 24\) binary matrices with good implementation properties for lightweight block ciphers and hash functions
- Recursive diffusion layers for block ciphers and hash functions
- Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
- Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
- Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- On construction of involutory MDS matrices from Vandermonde matrices in \(\mathrm{GF}(2^q)\)
- The block cipher \textsc{Square}
- Direct construction of recursive MDS diffusion layers using shortened BCH codes
- Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions
- Recursive diffusion layers for block ciphers and hash functions
- Lightweight MDS involution matrices
- Constructing S-boxes for lightweight cryptography with Feistel structure
- Title not available (Why is that?)
- On the algebraic construction of cryptographically good \(32 \times 32\) binary linear transformations
- On Constructing of a 32 ×32 Binary Matrix as a Diffusion Layer for a 256-Bit Block Cipher
- Title not available (Why is that?)
Cited In (5)
- On the algebraic construction of cryptographically good \(32 \times 32\) binary linear transformations
- Cryptographic properties of cyclic binary matrices
- On the (im)possibility of improving the round diffusion of generalized Feistel structures
- A new algorithm for computing branch number of non-singular matrices over finite fields
- On the construction of \(20 \times 20\) and \(2 4 \times 24\) binary matrices with good implementation properties for lightweight block ciphers and hash functions
Uses Software
This page was built for publication: Constructing lightweight optimal diffusion primitives with Feistel structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807222)
