12 citations · 78 across the 56 of their papers we have counts for
8 papers · 1 filter
A Proof of the Beierle-Kranz-Leander Conjecture related to Lightweight Multiplication in $\mathds{F}_{2^n}$
Sihem Mesnager, Kwang Ho Kim, Dujin Jo +3
Lightweight cryptography is a key tool for building strong security solutions for pervasive devices with limited resources. Due to the stringent cost constraints inherent in extrem…
Improved upper bound on root number of linearized polynomials and its application to nonlinearity estimation of Boolean functions
Sihem Mesnager, Kwang Ho Kim, Myong Song Jo
To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystem…
Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences
Cunsheng Ding, Sihem Mesnager, Chunming Tang +1
Let be an even positive integer. A Boolean bent function on $\GF{m-1} \times \GF {}$ is called a \emph{cyclic bent function} if for any $a\neq b\in \GF {m-1}$ and $ε\in \GF…
Two constructions of optimal pairs of linear codes for resisting side channel and fault injection attacks
Claude Carlet, Chengju Li, Sihem Mesnager
Direct sum masking (DSM) has been proposed as a counter-measure against side-channel attacks (SCA) and fault injection attacks (FIA), which are nowadays important domains of crypta…
Strongly regular graphs from weakly regular plateaued functions
Sihem Mesnager, Ahmet Sınak
The paper provides the first constructions of strongly regular graphs and association schemes from weakly regular plateaued functions over finite fields of odd characteristic. We g…
Several classes of minimal linear codes with few weights from weakly regular plateaued functions
Sihem Mesnager, Ahmet Sınak
Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is…