Kwang Ho Kim

According to our database1, Kwang Ho Kim authored at least 28 papers between 2007 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Complete solution over $\GF{p^n}$ of the equation X<sup>p<sup>k+1</sup>+X+a=0</sup>.
IACR Cryptol. ePrint Arch., 2021

Solving <i>X</i><sup><i>q</i>+1</sup> + <i>X</i> + <i>a</i> = 0 over finite fields.
Finite Fields Their Appl., 2021

A direct proof of APN-ness of the Kasami functions.
Des. Codes Cryptogr., 2021

Complete solution over F<sub>p<sup>n</sup></sub> of the equation X<sup>p<sup>k</sup>+1</sup>+X+a=0.
CoRR, 2021

2020
Solving some affine equations over finite fields.
Finite Fields Their Appl., 2020

Solving x2k+1+x+a=0 in F2n with gcd⁡(n, k)=1.
Finite Fields Their Appl., 2020

A proof of the Beierle-Kranz-Leander conjecture related to lightweight multiplication in $\mathbb {F}_{2^n}$.
Des. Codes Cryptogr., 2020

Preimages of p-Linearized Polynomials over F<sub>p</sub>.
CoRR, 2020

On the number of the rational zeros of linearized polynomials and the second-order nonlinearity of cubic Boolean functions.
Cryptogr. Commun., 2020

On the Menezes-Teske-Weng conjecture.
Cryptogr. Commun., 2020

Solving x+x<sup>2<sup>l</sup></sup>+... +x<sup>2<sup>ml</sup></sup>=a over $\mathbb {F}_{2^{n}}$.
Cryptogr. Commun., 2020

Speeding up regular elliptic curve scalar multiplication without precomputation.
Adv. Math. Commun., 2020

2019
A Proof of the Beierle-Kranz-Leander's Conjecture related to Lightweight Multiplication in F<sub>2<sup>n</sup></sub>.
IACR Cryptol. ePrint Arch., 2019

Solving x<sup>2<sup>k</sup>+1</sup>+x+a=0 in 픽<sub>2<sup>n</sup></sub> with gcd(n, k)=1.
IACR Cryptol. ePrint Arch., 2019

Solving X<sup>q+1</sup>+X+a=0 over Finite Fields.
IACR Cryptol. ePrint Arch., 2019

Solutions of x<sup>q<sup>k</sup>+...+x<sup>q</sup>+x=a</sup> in GF(2<sup>n)</sup>.
IACR Cryptol. ePrint Arch., 2019

Solutions of x<sup>q<sup>k</sup></sup>+...+x<sup>q</sup>+x=a in GF{2<sup>n</sup>}.
CoRR, 2019

Solving x<sup>2<sup>k</sup>+1</sup>+x+a=0 in F<sub>2<sup>n</sup></sub> with gcd(n, k)=1.
CoRR, 2019

2018
Improved upper bound on root number of linearized polynomials and its application to nonlinearity estimation of Boolean functions.
IACR Cryptol. ePrint Arch., 2018

On the Menezes-Teske-Weng's conjecture.
IACR Cryptol. ePrint Arch., 2018

A Proof of the Beierle-Kranz-Leander Conjecture related to Lightweight Multiplication in F<sub>2<sup>n</sup></sub>.
CoRR, 2018

2017
Speeding up Elliptic Curve Scalar Multiplication without Precomputation.
IACR Cryptol. ePrint Arch., 2017

2015
New Fast Algorithms for Elliptic Curve Arithmetic in Affine Coordinates.
Proceedings of the Advances in Information and Computer Security, 2015

2014
Binary Edwards Curves Revisited.
Proceedings of the Progress in Cryptology - INDOCRYPT 2014, 2014

2008
Point Multiplication on Supersingular Elliptic Curves Defined over Fields of Characteristic 2 and 3.
Proceedings of the SECRYPT 2008, 2008

2007
New Fast Algorithms for Arithmetic on Elliptic Curves over Fields of Characteristic Three.
IACR Cryptol. ePrint Arch., 2007

A New Method for Speeding Up Arithmetic on Elliptic Curves over Binary Fields.
IACR Cryptol. ePrint Arch., 2007

A Note on Point Multiplication on Supersingular Elliptic Curves over Ternary Fields.
IACR Cryptol. ePrint Arch., 2007


  Loading...