Substitution boxes (S-boxes) play a significant role in ensuring the
res...
Subspace codes have important applications in random network coding. It ...
A substitution box (S-box) in a symmetric primitive is a mapping F that
...
Let F(X)=X^2^2k+2^k+1 be the power function over the finite field
2^4k w...
This paper deals with Niho functions which are one of the most important...
Planar functions, introduced by Dembowski and Ostrom, have attracted muc...
Planar functions, introduced by Dembowski and Ostrom, are functions from...
Subfield codes of linear codes over finite fields have recently received...
S-boxes are an important primitive that help cryptographic algorithms to...
Cyclic codes have many applications in consumer electronics, communicati...
Only three classes of Almost Perfect Nonlinear (for short, APN) power
fu...
Permutation polynomials over finite fields are fundamental objects as th...
In this article, we focus on the concept of locally-APN-ness (“APN" is t...
This article determines all the solutions in the finite field GF2^4n of
...
Aiming to recover the data from several concurrent node failures, linear...
The Bose-Chaudhuri-Hocquenghem (BCH) codes are a well-studied subclass o...
Cross Z-complementary pairs (CZCPs) are a special kind of Z-complementar...
This paper is devoted to sequences and focuses on designing new
two-dime...
Because of the recent applications to distributed storage systems,
resea...
The problem of solving explicitly the equation P_a(X):=X^q+1+X+a=0 over
...
Linearized polynomials over finite fields have been intensively studied ...
In a prior paper <cit.>, two of us, along with P. Ellingsen, P. Felke
an...
Nowadays, the resistance against algebraic attacks and fast algebraic at...
Boolean functions with high algebraic immunity are important cryptograph...
Let l and k be two integers such that l|k. Define
T_l^k(X):=X+X^p^l+...+...
Using recent results on solving the equation X^2^k+1+X+a=0 over a finite...
Solving the equation P_a(X):=X^q+1+X+a=0 over finite field Q,
where Q=p^...
2-to-1 mappings over finite fields play an important role in symmetric
c...
Minimal linear codes have interesting applications in secret sharing sch...
Two-to-one (2-to-1) mappings over finite fields play an important role i...
Though it is well known that the roots of any affine polynomial over a f...
Codebooks with small inner-product correlation have application in unita...
Let N_a be the number of solutions to the equation x^2^k+1+x+a=0 in
n wh...
BCH codes with efficient encoding and decoding algorithms have many
appl...
At Eurocrypt'18, Cid, Huang, Peyrin, Sasaki, and Song introduced a new t...
Lightweight cryptography is a key tool for building strong security solu...
To determine the dimension of null space of any given linearized polynom...
Let m be an even positive integer. A Boolean bent function f on m-1× is ...
The paper provides the first constructions of strongly regular graphs an...
Direct sum masking (DSM) has been proposed as a counter-measure against
...
Minimal linear codes have significant applications in secret sharing sch...
In 2003, Alfred Menezes, Edlyn Teske and Annegret Weng presented a conje...
In 2018, Pott, at al. have studied in [IEEE Transactions on Information
...
In this paper we study the relationship between vectorial (Boolean) func...