main-content

## Cryptography and Communications OnlineFirst articles

17-08-2019

### The cycle structure of NFSR(fd) and its applications

Let NFSR(f ) denote the nonlinear feedback shift register (NFSR) with characteristic function f = x0 ⊕ g(x1,x2,…,xn− 1) ⊕ xn. In this paper, the cycle structure of NFSR(fd) is discussed, where f d = x 0 ⊕ g ( x d , x 2 d , … , x ( n − 1 ) d ) ⊕ x …

17-08-2019

### Upper bounds on the multiplicative complexity of symmetric Boolean functions

A special metric of interest about Boolean functions is multiplicative complexity (MC): the minimum number of AND gates sufficient to implement a function with a Boolean circuit over the basis {XOR, AND, NOT}. In this paper we study the MC of …

14-08-2019

### One-weight and two-weight -additive codes

In this paper, a class of additive codes which is referred to as ℤ 2 ℤ 2 [ u , v ] $\mathbb {Z}_{2}\mathbb {Z}_{2}[u,v]$ -additive codes is introduced. This is a generalization towards another direction of recently introduced ℤ 2 ℤ 4 \$\mathbb …

08-08-2019 | TC: SETA 2018 (by invitation only)

### On generalized hyper-bent functions

Hyper-bent Boolean functions were introduced in 2001 by Youssef and Gong (and initially proposed by Golomb and Gong in 1999 as a component of S-boxes) to ensure the security of symmetric cryptosystems but no cryptographic attack has been …

06-08-2019

### Integer codes correcting burst asymmetric within a byte and double asymmetric errors

This paper presents a class of integer codes capable of correcting l-bit burst asymmetric errors within a b-bit byte (1 ≤ l < b) and double asymmetric errors within a codeword. The presented codes are constructed with the help of a computer and …