Squeezing a vectorial nonlinear binary transformation between two perpendicular matrices

08/26/2019
by   Claude Gravel, et al.
0

We propose a new primitive that could serve as a component in the design of block ciphers defined over a vector space of characteristic two. The primitive consists of squeezing a vectorial non-linear boolean function between two linear transformations. More precisely, the primitive transformation consists of a (linear compression) → (keyed nonlinear transformation) → (linear decompression) feed back with its input and then linearly transformed. We impose that the compression and decompression be perpendicular matrices for the system to be invertible even if the nonlinear part is not invertible. Our scheme has the practical advantage that many interesting properties of an entire round reduce only to those of the nonlinear transformation. As a matter of fact, we prove a lower bound on the minimal number of iterations, assuming independent keys uniformly distributed among iterations, to avoid paths both in the space of first order differences (differential cryptanalysis) as well as in the space of linear first order correlations (linear cryptanalysis) up to a desired threshold. We neither focus in this paper on the key scheduling algorithm nor on the nonlinear part and solely analyze how the linear components must be set up to be resilient against the aforementioned cryptanalytic attacks. Examples of our scheme are round functions of well-known block ciphers such as DES or IDEA-NXT based on the Lai-Massey scheme, families of block ciphers such as the original Feistel networks and generalized Feistel networks, as long as the underlying field has characteristic two and that no modular arithmetic is involved.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2019

A Vector Space Approach to Generate Dynamic Keys for Hill Cipher

In this paper a variant of the Hill cipher is proposed. In the classical...
research
11/02/2017

Using Bernstein-Vazirani Algorithm to Attack Block Ciphers

In this paper, we study applications of Bernstein-Vazirani algorithm and...
research
03/02/2018

Type-Preserving Matrices and Security of Block Ciphers

We provide a new property, called Non-Type-Preserving, for a mixing laye...
research
11/17/2020

A Block-Permutation-Based Encryption Scheme with Independent Processing of RGB Components

This paper proposes a block-permutation-based encryption (BPBE) scheme f...
research
04/23/2020

The number of almost perfect nonlinear functions grows exponentially

Almost perfect nonlinear (APN) functions play an important role in the d...
research
07/07/2021

Semilinear transformations in coding theory and their application to cryptography

This paper presents a brand-new idea of masking the algebraic structure ...
research
03/10/2021

On the primitivity of the AES key-schedule

The key-scheduling algorithm in the AES is the component responsible for...

Please sign up or login with your details

Forgot password? Click here to reset