Dong, Le Wu, Wenling Wu, Shuang Zou, Jian
Published in
Frontiers of Computer Science

We present some known-key distinguishers for a type-1 Feistel scheme with a permutation as the round function. To be more specific, the 29-round known-key truncated differential distinguishers are given for the 256-bit type-1 Feistel scheme with an SP (substitution-permutation) round function by using the rebound attack, where the S -boxes have per...

Kyureghyan, Gohar Suder, Valentin

In this paper we determined explicitly the multiplicative inverses of the Dobbertin and Welch APN exponents in Z2n−1, and we described the binary weights of the inverses of the Gold and Kasami exponents. We studied the function Invd(n), which for a fixed positive integer d maps integers n⩾1 to the least positive residue of the inverse of d modulo 2...

Boura, Christina Canteaut, Anne

We present a study on the algebraic degree of iterated permutations seen as multivariate polynomials. The main result shows that this degree depends on the algebraic degree of the inverse of the permutation which is iterated. This result is also extended to non-injective balanced vectorial functions where the relevant quantity is the minimal degree...

Duan, Ming Lai, XueJia
Published in
Chinese Science Bulletin

Keccak is one of the five hash functions selected for the final round of the SHA-3 competition, and its inner primitive is a permutation called Keccak-f. In this paper, we observe that for the inverse of the only nonlinear transformation in Keccak-f, the algebraic degree of any output coordinate and the one of the product of any two output coordina...

Pan, Sen-Shan Fu, Xiao-Tong Zhang, Wei-Guo
Published in
Journal of Computer Science and Technology

This paper presents a construction for a class of 1-resilient functions with optimal algebraic immunity on an even number of variables. The construction is based on the concatenation of two balanced functions in associative classes. For some n, a part of 1-resilient functions with maximum algebraic immunity constructed in the paper can achieve almo...

Liu, MeiCheng Pei, DingYi Du, YuSong
Published in
Science China Information Sciences

Boolean functions with maximum algebraic immunity have been considered as one class of cryptographically significant functions. It is known that Boolean functions on odd variables have maximum algebraic immunity if and only if a correlative matrix has column full rank, and Boolean functions on even variables have maximum algebraic immunity if and o...

Pasalic, Enes

In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree in the original class. Preserving a high-nonlinear...

Pasalic, Enes

In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree in the original class. Preserving a high-nonlinear...

Pasalic, Enes

In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree in the original class. Preserving a high-nonlinear...

Pasalic, Enes

In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree in the original class. Preserving a high-nonlinear...