Université Paris 8

output

20022025

most citedModeling urban street patterns

275 citations

researchers with a paper here

collaborating institutions

Showing 2019 · cs.ITShow all

5 papers · 2 filters

cs.IT2019★ 2 cited

Solving $X^{q + 1} + X + a = 0$ over Finite Fields

Kwang Ho Kim, Junyop Choe, Sihem Mesnager

Solving the equation $P_{a} (X) := X^{q + 1} + X + a = 0$ over finite field $\GF{Q}$, where $Q = p^{n}, q = p^{k}$ and $p$ is a prime, arises in many different contexts including finite geometry, the i…

cs.IT2019★ 3 cited

Further study of $2$ -to- $1$ mappings over $F_{2^{n}}$

Kangquan Li, Sihem Mesnager, Longjiang Qu

$2$ -to- $1$ mappings over finite fields play an important role in symmetric cryptography, in particular in the constructions of APN functions, bent functions, semi-bent functions an…

cs.IT2019

On two-to-one mappings over finite fields

Sihem Mesnager, Longjiang Qu

Two-to-one ( $2$ -to- $1$ ) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent…

cs.IT2019★ 4 cited

Solving $x^{2^{k} + 1} + x + a = 0$ in $F_{2^{n}}$ with $g cd (n, k) = 1$

Kwang Ho Kim, Sihem Mesnager

Let $N_{a}$ be the number of solutions to the equation $x^{2^{k} + 1} + x + a = 0$ in $\GF {n}$ where $g cd (k, n) = 1$ . In 2004, by Bluher \cite{BLUHER2004} it was known that possible values of $…

cs.IT2019

A class of narrow-sense BCH codes over $F_{q}$ of length $\frac{q ^{m} - 1}{2}$

Xin Ling, Sihem Mesnager, Yanfeng Qi +1

BCH codes with efficient encoding and decoding algorithms have many applications in communications, cryptography and combinatorics design. This paper studies a class of linear code…

Solving Xq+1+X+a=0 over Finite Fields

Further study of 2-to-1 mappings over F2n​

On two-to-one mappings over finite fields

Solving x2k+1+x+a=0 in F2n​ with gcd(n,k)=1

A class of narrow-sense BCH codes over Fq​ of length 2qm−1​

Solving $X^{q + 1} + X + a = 0$ over Finite Fields

Further study of $2$ -to- $1$ mappings over $F_{2^{n}}$

Solving $x^{2^{k} + 1} + x + a = 0$ in $F_{2^{n}}$ with $g cd (n, k) = 1$

A class of narrow-sense BCH codes over $F_{q}$ of length $\frac{q ^{m} - 1}{2}$