Minwoo Lee

Dr. Minwoo Lee


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
19 September 2025 in Electronics
Verified
Journal Article
Open access
PDF file
MSMinjoo Sim
Minjoo Sim
GSGyeongJu Song
GyeongJu Song
SESiwoo Eum
Siwoo Eum
MLMinwoo Lee
Minwoo Lee
SYSeyoung Yoon
Seyoung Yoon
HSHwajeong Seo
Hwajeong Seo
Advances in quantum computing pose a fundamental threat to classical public-key cryptosystems, including RSA and elliptic-curve cryptography (ECC), which form the foundation for authentication and key exchange in the Transport Layer Security (TLS) protocol. In response to these emerging threats, Korea launched the KpqC (Korea Post-Quantum Cryptography) project in 2021 to design, evaluate, and standardize domestic PQC algorithms. To the best of our knowledge, this is the first systematic evaluation of the finalized Korean PQC algorithms (HAETAE, AIMer, SMAUG-T, NTRU+) within a production-grade TLS/X.509 stack, enabling direct comparison against NIST PQC and ECC baselines. To contextualize KpqC performance, we further compare against NIST-standardized PQC algorithms and classical ECC baselines. Our evaluation examines both static overhead (certificate size) and dynamic overhead (TLS 1.3 handshake latency) across computation-bound (localhost) and network-bound (LAN) scenarios, including embedded device and hybrid TLS configurations. Our results show that KpqC certificates are approximately 4.6–48.8× larger than ECC counterparts and generally exceed NIST PQC sizes. In computation-bound tests, both NIST PQC (ML-KEM) and KpqC hybrids exhibited similar handshake latency increases of approximately 8–9× relative to ECC. In network-bound tests, the difference between the two families was negligible, with relative overhead typically around 30–41%. These findings offer practical guidance for balancing security level, key size, packet size, and latency and support phased PQC migration strategies in real-world TLS deployments.

11 January 2024
Verified
Book Chapter
Closed access
PDF file
HKHyeokDong Kwon
HyeokDong Kwon
MSMinjoo Sim
Minjoo Sim
GSGyeongJu Song
GyeongJu Song
MLMinwoo Lee
Minwoo Lee
HSHwajeong Seo
Hwajeong Seo

11 January 2024
Verified
Book Chapter
Closed access
PDF file
MSMinjoo Sim
Minjoo Sim
HKHyeokDong Kwon
HyeokDong Kwon
SESiwoo Eum
Siwoo Eum
GSGyeongJu Song
GyeongJu Song
MLMinwoo Lee
Minwoo Lee
HSHwajeong Seo
Hwajeong Seo

29 September 2024 in Electronics
Verified
Journal Article
Open access
PDF file
MSMinjoo Sim
Minjoo Sim
MLMinwoo Lee
Minwoo Lee
HSHwajeong Seo
Hwajeong Seo
In this work, we present the highly optimized implementation of the HAETAE algorithm, submitted to the second round of the Korean Post-Quantum Cryptography (KpqC) competition and to the first round of NIST’s additional post-quantum standardization for digital signatures on 64-bit ARMv8 embedded processors. To the best of our knowledge, this is the first optimized implementation of the HAETAE algorithm on 64-bit ARMv8 embedded processors. We apply various optimization techniques to enhance the multiplication operations in the HAETAE algorithm. We utilize parallel operation techniques involving vector registers and NEON (Advanced SIMD technology used in ARM processors) instructions of ARMv8 embedded processors. In particular, we achieved the best performance of the HAETAE algorithm on ARMv8 embedded processors by applying all the state-of-the-art NTT (Number Theoretic Transform) implementation techniques. Performance improvements of up to 3.07×, 3.63×, and 9.15× were confirmed for NTT, Inverse-NTT, and pointwise Montgomery operations (Montgomery multiplication used in modular arithmetic), respectively, by applying the state-of-the-art implementation techniques, including the proposed techniques. As a result, we achieved a maximum performance improvement of up to 1.16× for the key generation algorithm, up to 1.14× for the signature algorithm, and up to 1.25× for the verification algorithm.

25 September 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SESiwoo Eum
Siwoo Eum
MLMinwoo Lee
Minwoo Lee
HSHwajeong Seo
Hwajeong Seo
This study proposes an optimized implementation of the HAWK Signature algorithm, one of the candidates in the first evaluation round for additional digital signature schemes in the NIST Post-Quantum Cryptography competition. The core motivation of this research is to improve the performance of HAWK algorithm. By conducting profiling analysis to identify, we identified the most resource-intensive functions. And then we optimized the functions. The optimization techniques through profiling analysis are not limited to HAWK but can be applied to other algorithms as well. Additionally, the study demonstrates how efficient optimization can be achieved using fewer instructions by leveraging lesser-known ARMv8 instructions. By targeting the functions with the highest overhead and utilizing fewer instructions, a performance improvement of approximately 2.5% for Hawk512 and 4% for Hawk1024 was achieved, respectively. These results confirm that combining profiling analysis with efficient instruction usage can lead to significant performance improvements.

31 October 2023 in Electronics
Verified
Journal Article
Open access
PDF file
GSGyeongJu Song
GyeongJu Song
SESiwoo Eum
Siwoo Eum
HKHyeokDong Kwon
HyeokDong Kwon
MSMinjoo Sim
Minjoo Sim
MLMinwoo Lee
Minwoo Lee
HSHwajeong Seo
Hwajeong Seo
This paper explores the optimization of quantum circuits for Argon2, a memory-hard function used in password hashing applications. With the rise of quantum computers, the security of classical cryptographic systems is at risk. This paper emphasizes the need to accurately measure the quantum security strength of cryptographic schemes through highly optimized quantum circuits for the target cryptography algorithm. The proposed method focuses on two perspectives: qubit reduction (qubit-optimized quantum circuit) and depth reduction (depth-optimized quantum circuit). The qubit-optimized quantum circuit was designed to find a point where an appropriate inverse is possible and reuses the qubit through the inverse to minimize the number of qubits. The start and end points of the inverse are determined by identifying a point where qubits can be reused with minimal computation. The depth-optimized quantum circuit reduces the depth of the quantum circuit by using the minimum number of qubits necessary without performing an inverse operation. The trade-off between qubit and depth is confirmed by modifying the internal structure of the circuits and the quantum adders. The qubit optimization achieved up to a 12,229 qubit reduction, while the depth optimization resulted in an approximately 196,741 (approximately 69.02%) depth reduction. In conclusion, this research demonstrates the importance of implementing and analyzing quantum circuits from multiple optimization perspectives. The results contribute to the post-quantum strength analysis of Argon2 and provide valuable insights for future research on optimized quantum circuit design, considering the appropriate trade-offs of quantum resources in response to advancements in quantum computing technology.