Known-key distinguishers on 15-round 4-branch type-2 generalised Feistel networks with single substitution–permutation functions and near-collision attacks on its hashing modes

Generalised Feistel network (GFN) is a popular design for block ciphers and hash functions. The round function of the network often chooses a substitution–permutation (SP) transformation (consists of a subkey XOR, an S-boxes layer and a linear layer). In 2011, Bogdanov and Shibutani provided another...

Full description

Saved in:
Bibliographic Details
Published in:IET information security Vol. 9; no. 5; pp. 277 - 283
Main Authors: Dong, Le, Wang, Yanling, Wu, Wenling, Zou, Jian
Format: Journal Article
Language:English
Published: The Institution of Engineering and Technology 01.09.2015
Subjects:
15‐round 4‐branch type‐2 generalised Feistel networks
15‐round near‐collision attacks
4‐branch type‐2 GFN
block ciphers
Blocking
Compressing
Computer information security
Construction
Cryptography
differential cryptanalysis
double SP‐functions
Encryption
file organisation
hash functions
hashing modes
known‐key distinguishers
linear cryptanalysis
linear layer
Matyas–Meyer–Oseas
Miyaguchi–Preneel compression function modes
near‐collision attacks
Networks
rebound attack techniques
single SP‐function
single substitution permutation functions
SP transformation
SP‐layers
subkey XOR
substitution permutation transformation
S‐boxes layer
Transformations (mathematics)
single SP-function
hashing modes
cryptography
double SP-functions
near-collision attacks
hash functions
differential cryptanalysis
Miyaguchi–Preneel compression function modes
single substitution permutation functions
substitution permutation transformation
linear cryptanalysis
known-key distinguishers
block ciphers
rebound attack techniques
Matyas–Meyer–Oseas
SP-layers
15-round 4-branch type-2 generalised Feistel networks
SP transformation
linear layer
15-round near-collision attacks
file organisation
S-boxes layer
subkey XOR
4-branch type-2 GFN
ISSN:1751-8709, 1751-8717
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Generalised Feistel network (GFN) is a popular design for block ciphers and hash functions. The round function of the network often chooses a substitution–permutation (SP) transformation (consists of a subkey XOR, an S-boxes layer and a linear layer). In 2011, Bogdanov and Shibutani provided another choice to build round functions, namely the double SP-functions, which has two SP-layers in series. They showed that a 4-branch type-2 GFN with double SP-functions was stronger than the one with single SP-function in terms of the number of active S-boxes in a differential or linear cryptanalysis, but some subsequent results showed that the double SP-function is the weaker one in some known-key scenarios and hashing modes. In this study, the authors present a new result of the 4-branch type-2 GFN, whose round function is a single SP-function. They show some 15-round truncated differential distinguishers for this network with four usual parameters by utilising some rebound attack techniques. Based on these distinguishers, they construct some 15-round near-collision attacks on the Matyas–Meyer–Oseas and Miyaguchi–Preneel compression function modes in which the 4-branch type-2 GFN with the single SP-function is used.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1751-8709
1751-8717
DOI:10.1049/iet-ifs.2014.0402