So Hyun Park

So Hyun Park

Auto-generated profile, based on publicly available information

So Hyun Park

Graduate School of Information Security, Korea University, Seoul, South Korea

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 June 2020 in IEEE Access
Verified
Journal Article
Open access
SPSo Hyun Park
So Hyun Park
SKSuhri Kim
Suhri Kim
DLDongHoon Lee
DongHoon Lee
JPJong Hwan Park
Jong Hwan Park
In the field of post-quantum cryptography, lattice-based cryptography has received the most noticeable attention. Most lattice-based cryptographic schemes are constructed based on the polynomial ring $R_{q}=\mathbb {Z}_{q}[x]/f(x)$ , using a cyclotomic polynomial $f(x)$ . Until now, the most preferred cyclotomic polynomials have been $x^{n}+1$ , where $n$ is a power of two, and $x^{n}+ \cdots +x +1$ , where $n+1$ is a prime. The former results in the smallest decryption error size, but the choice of degree is limited. On the other hand, the latter gives rise to the largest decryption error size, but the choice of degree is very flexible. In this paper, we use a new polynomial ring $R_{q}=\mathbb {Z}_{q}/f(x)$ with a cyclotomic trinomial $f(x)=x^{n}-x^{n/2}+1$ as an intermediate that combines the advantages of the other rings. Since the degree $n$ is chosen freely as $n=2^{a}3^{b}$ for positive integers $a$ and $b$ , the choice of the degree $n$ is moderate. Furthermore, since the error propagation is small in the middle of polynomial multiplication in the new ring, if the middle part is truncated and used, the decryption error size can be reduced. Based on these observations, we propose a new, practical key encapsulation mechanism (KEM) that is constructed over a ring with a cyclotomic trinomial. The security of our KEM is based on the hardness of ring learning-with-rounding (LWR) problems. With appropriate parameterization for the current 128-bit security model, we show that our KEM obtains shorter secret keys and ciphertexts, especially compared to the previous Ring-LWR-based KEM, Round5, with no error correction code. We then implement our KEM and compare its performance with that of several KEMs that were presented in the second round of the NIST PQC conference.