Namhun Koo

Namhun Koo

Auto-generated profile, based on publicly available information

Namhun Koo

Institute of Basic Science Sungkyunkwan University Suwon Korea

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
16 August 2018 in IACR Transactions on Cryptographic Hardware and Embedded Systems
Verified
Journal Article
Open access
PDF file
APAesun Park
Aesun Park
KSKyung-Ah Shim
Kyung-Ah Shim
NKNamhun Koo
Namhun Koo
DHDong-Guk Han
Dong-Guk Han
In this paper, we investigate the security of Rainbow and Unbalanced Oil-and-Vinegar (UOV) signature schemes based on multivariate quadratic equations, which is one of the most promising alternatives for post-quantum signature schemes, against side-channel attacks. We describe correlation power analysis (CPA) on the schemes that yield full secret key recoveries. First, we identify a secret leakage of secret affine maps S and T during matrix-vector products in signing when Rainbow is implemented with equivalent keys rather than random affine maps for optimal implementations. In this case, the simple structure of the equivalent keys leads to the retrieval of the entire secret affine map T. Next, we extend the full secret key recovery to the general case using random affine maps via a hybrid attack: after recovering S by performing CPA, we recover T by mounting algebraic key recovery attacks. We demonstrate how this leakage on Rainbow can be practically exploited on an 8-bit AVR microcontroller using CPA. Consequently, our CPA can be applied to Rainbow-like multi-layered schemes regardless of the use of the simple-structured equivalent keys and UOV-like single layer schemes with the implementations using the equivalent keys of the simple structure. This is the first result on the security of multivariate quadratic equations-based signature schemes using only CPA. Our result can be applied to Rainbow-like multi-layered schemes and UOV-like single layer schemes submitted to NIST for Post-Quantum Cryptography Standardization.

17 February 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
KSKyung-Ah Shim
Kyung-Ah Shim
CPCheol-Min Park
Cheol-Min Park
NKNamhun Koo
Namhun Koo
HSHwajeong Seo
Hwajeong Seo
More than 98 % of all microprocessors sold worldwide are used in embedded devices, and will continue to accelerate due to emerging applications in Internet of Things (IoTs). Cryptographic algorithms based on multivariate quadratic equations are suitable for low-cost IoT constrained devices since they require only modest computational resources. We describe the design and implementations of a new public-key signature scheme based on multivariate quadratic equations highly optimized for practicability. The novel scheme is obtained as a result of the combination of solvable systems of quadratic equations and sparse polynomials. We provide security analysis of our scheme against known algebraic attacks and derive a concrete parameter. Performance of our scheme on an 8-bit AVR microprocessor is the fastest among known signature schemes: signing of our scheme is about 36.4x faster than that of ECDSA-256 (NIST P-256) the most widely deployed international standard signature scheme. Signing of our scheme is about 8.6x and 11.0x faster than those of Rainbow and BLISS-BI, respectively. The secret size of our scheme has reduced by a factor of 87% compared to Rainbow. Our scheme requires signatures of 80 bytes which is comparable to ECDSA-256 of 64 bytes. We also implement a protected version of our scheme on the 8-bit microprocessor to prevent the current side-channel attacks presented in CHES 2018. Even our protected version is the fastest singing among known signature schemes.

3 February 2020 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
KSKyung-Ah Shim
Kyung-Ah Shim
NKNamhun Koo
Namhun Koo

8 February 2014 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
GCGook Hwa Cho
Gook Hwa Cho
NKNamhun Koo
Namhun Koo
EHEunhye Ha
Eunhye Ha
SKSoonhak Kwon
Soonhak Kwon

19 November 2021 in IACR Transactions on Cryptographic Hardware and Embedded Systems
Verified
Journal Article
Open access
PDF file
KSKyung-Ah Shim
Kyung-Ah Shim
SLSangyub Lee
Sangyub Lee
NKNamhun Koo
Namhun Koo
A signature scheme based on multivariate quadratic equations, Rainbow, was selected as one of digital signature finalists for NIST Post-Quantum Cryptography Standardization Round 3. In this paper, we provide efficient implementations of Rainbow and UOV using the AVX2 instruction set. These efficient implementations include several optimizations for signing to accelerate solving linear systems and the Vinegar value substitution. We propose a new block matrix inversion (BMI) method using the Lower-Diagonal-Upper decomposition of blocks matrices based on the Schur complement that accelerates solving linear systems. Compared to UOV implemented with Gaussian elimination, our implementations with the BMI result in speedups of 12.36%, 24.3%, and 34% for signing at security categories I, III, and V, respectively. Compared to Rainbow implemented with Gaussian elimination, our implementations with the BMI result in speedups of 16.13% and 20.73% at the security categories III and V, respectively. We show that precomputation for the Vinegar value substitution and solving linear systems dramatically improve their signing. UOV with precomputation is 16.9 times, 35.5 times, and 62.8 times faster than UOV without precomputation at the three security categories, respectively. Rainbow with precomputation is 2.1 times, 2.2 times, and 2.8 times faster than Rainbow without precomputation at the three security categories, respectively. We then investigate resilience against leakage or reuse of the precomputed values in UOV and Rainbow to use the precomputation securely: leakage or reuse of the precomputed values leads to their full secret key recoveries in polynomial-time.

1 January 2022 in Finite Fields and Their Applications
Verified
Journal Article
Closed access
JJJaeseong Jeong
Jaeseong Jeong
NKNamhun Koo
Namhun Koo
SKSoonhak Kwon
Soonhak Kwon