Verification of restricted EA-equivalence for vectorial boolean functions

Authors:
Lilya Budaghyan;Oleksandr Kazymyrov
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Year:
2012

Citing 5
Cited 0

Differentially uniform mappings for cryptography

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Linear cryptanalysis method for DES cipher

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems

Designs, Codes and Cryptography
The Design of Rijndael

The Design of Rijndael
A toolbox for cryptanalysis: linear and affine equivalence algorithms

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present algorithms for solving the restricted extended affine equivalence (REA-equivalence) problem for any m-dimensional vectorial Boolean functions in n variables. The best of them has complexity O(22n+1) for REA-equivalence F(x)=M1 ·G(x⊕V2)⊕M3 ·x⊕V1. The algorithms are compared with previous effective algorithms for solving the linear and the affine equivalence problem for permutations by Biryukov et. al [1].