Dok Nam Lee

activity

20182020

x^{q^{k}} + \dots + x^{q} + x = a

GF 2^{n}

2 citations · 3 across the 3 of their papers we have counts for

collaborators

4 papers

cs.IT2020

Preimages of $p -$ Linearized Polynomials over $\GF{p}$

Kwang Ho Kim, Sihem Mesnager, Jong Hyok Choe +1

Linearized polynomials over finite fields have been intensively studied over the last several decades. Interesting new applications of linearized polynomials to coding theory and f…

cs.IT2020

Solving Some Affine Equations over Finite Fields

Sihem Mesnager, Kwang Ho Kim, Jong Hyok Choe +1

Let $l$ and $k$ be two integers such that $l ∣ k$ . Define $T_{l}^{k} (X) := X + X^{p^{l}} + \dots + X^{p^{l (k / l - 2)}} + X^{p^{l (k / l - 1)}}$ and $S_l^k(X):=X-X^{p^l}+\cdots+(-1)^{(k/l-1)}X^{p^{l(k/l-1)}…

cs.IT2019★ 2 cited

Solutions of $x^{q^{k}} + \dots + x^{q} + x = a$ in $GF 2^{n}$

Kwang Ho Kim, Jong Hyok Choe, Dok Nam Lee +2

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solvin…

cs.IT2018★ 1 cited

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…

Preimages of p−Linearized Polynomials over $\GF{p}$

Solving Some Affine Equations over Finite Fields

Solutions of xqk+⋯+xq+x=a in GF2n

A Proof of the Beierle-Kranz-Leander Conjecture related to Lightweight Multiplication in $\mathds{F}_{2^n}$

Preimages of $p -$ Linearized Polynomials over $\GF{p}$

Solutions of $x^{q^{k}} + \dots + x^{q} + x = a$ in $GF 2^{n}$