Gyeongju Song
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gyeongju Song has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Hwajeong Seo
Department of Information Computer Engineering, Hansung University, Seoul 02876, Republic of Korea
22 shared publications - Kyungbae Jang
Hansung University
12 shared publications - Minjoo Sim
Hansung University
12 shared publications - Siwoo Eum
Department of Information Computer Engineering, Hansung University, Seoul 02876, Republic of Korea
12 shared publications - Hyeokdong Kwon
Division of IT Convergence Engineering, Hansung University, Seoul 02876, Korea
7 shared publications - Hyunji Kim
Division of IT Convergence Engineering, Hansung University, Seoul 02876, Republic of Korea
6 shared publications
Latest Publications
- 1 May 2026
- Published by Springer Nature
- p. 182-197
Quantum Implementation of SHA-1
- 1 May 2026
- Published by Springer Nature
- p. 220-233
Quantum Circuit Implementation and Resource Analysis of AIM2
- 1 May 2026
- Published by Springer Nature
- p. 220-233
Quantum Circuit Implementation and Resource Analysis of AIM2
- Open Access
- 10 April 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (8) , 3705
Design-Space Mapping of Post-Quantum Cryptographic Artifact Transport on CAN-FD: A Discrete-Event Simulation Study
Post-quantum cryptography (PQC) artifacts are one to three orders of magnitude larger than their classical counterparts and must be segmented via ISO-TP across a shared CAN-FD bus while coexisting with periodic safety-critical traffic. No prior work has quantitatively mapped the transport-level feasibility of these artifacts under realistic multi-electronic control unit (ECU) contention. This paper presents a validated discrete-event simulator and evaluates 29 parameter sets from nine algorithm families—spanning the KpqC final portfolio, NIST FIPS 203–205 standards, and the draft FIPS 206—across 534 scenarios classified as feasible, borderline, or infeasible. Results show that key encapsulation mechanism (KEM) feasibility is scenario-dependent: domain scale and startup coordination dominate over algorithm choice, with 4-ECU staggered deployments feasible for all Level-1 candidates, while 16-ECU simultaneous startup is universally infeasible. For digital signatures, FN-DSA achieves the best transport feasibility due to its compact signature, while HQC is uniformly infeasible and SLH-DSA is nearly uniformly infeasible, quantifying the CAN-FD bandwidth premium of algorithmic diversity. System-side traffic shaping—staggered startup and reserved bus windows—outperforms algorithm substitution as a mitigation strategy. To the best of our knowledge, these findings constitute the first design-space map of PQC artifact transport on CAN-FD and provide actionable deployment guidelines for post-quantum transition.
- 10 April 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (8) , 3705
Open AccessDesign-Space Mapping of Post-Quantum Cryptographic Artifact Transport on CAN-FD: A Discrete-Event Simulation Study
Post-quantum cryptography (PQC) artifacts are one to three orders of magnitude larger than their classical counterparts and must be segmented via ISO-TP across a shared CAN-FD bus while coexisting with periodic safety-critical traffic. No prior work has quantitatively mapped the transport-level feasibility of these artifacts under realistic multi-electronic control unit (ECU) contention. This paper presents a validated discrete-event simulator and evaluates 29 parameter sets from nine algorithm families—spanning the KpqC final portfolio, NIST FIPS 203–205 standards, and the draft FIPS 206—across 534 scenarios classified as feasible, borderline, or infeasible. Results show that key encapsulation mechanism (KEM) feasibility is scenario-dependent: domain scale and startup coordination dominate over algorithm choice, with 4-ECU staggered deployments feasible for all Level-1 candidates, while 16-ECU simultaneous startup is universally infeasible. For digital signatures, FN-DSA achieves the best transport feasibility due to its compact signature, while HQC is uniformly infeasible and SLH-DSA is nearly uniformly infeasible, quantifying the CAN-FD bandwidth premium of algorithmic diversity. System-side traffic shaping—staggered startup and reserved bus windows—outperforms algorithm substitution as a mitigation strategy. To the best of our knowledge, these findings constitute the first design-space map of PQC artifact transport on CAN-FD and provide actionable deployment guidelines for post-quantum transition.
- Open Access
- 19 September 2025
- Published by MDPI AG in Electronics
- Vol. 14 (18) , 3717
Integrating and Benchmarking KpqC in TLS/X.509
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.
- 19 September 2025
- Published by MDPI AG in Electronics
- Vol. 14 (18) , 3717
Open AccessIntegrating and Benchmarking KpqC in TLS/X.509
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.
- Open Access
- 8 April 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (1)
Quantum Analysis of AES
Our work explores the key recovery attack using the Grover's search on the three variants of AES (-128, -192, -256). In total, we develop a pool of 26 implementations per AES variant (totaling 78), by taking the state-of-the-art advancements in the relevant fields into account. We present the least Toffoli depth and full depth implementations of AES, thereby improving from Zou et al.'s Asiacrypt'20 paper by more than 97 percent for each variant of AES. We show that the qubit count - Toffoli depth product is reduced from theirs by more than 87 percent. Furthermore, we analyze the Jaques et al.'s Eurocrypt'20 implementations in detail, fix the bugs (arising from some problem of the quantum computing tool used), and report corrected benchmarks (which seem to improve from the authors' own bug-fixing, thanks to our architecture consideration). To the best of our finding, our work improves from all the previous works (including the Asiacrypt'22 paper by Huang and Sun, the Asiacrypt'23 paper by Liu et al. and the Asiacrypt'24 paper by Shi and Feng) in terms of various quantum circuit complexity metrics. To be more precise, we estimate the currently best-known quantum attack complexities for AES-128 ( 2 156.2630 ), AES-192 ( 2 221.5801 ) and AES-256 ( 2 286.0731 ). Additionally, we achieve the least Toffoli depth - qubit count product for AES-128 ( 121920 , improving from 130720 by Shi and Feng in Asiacrypt'24), AES-192 ( 161664 , improving from 188880 by Liu et al. in Asiacrypt'23) and AES-256 ( 206528 , improving from 248024 by Liu et al. in Asiacrypt'23) so far. We further investigate the prospect of the Grover's search. We propose four new implementations of the S-box, one new implementation of the MixColumn; as well as five new architecture (one is motivated by the architecture by Jaques et al. in Eurocrypt'20, and the rest four are entirely our innovation). Under the MAXDEPTH constraint (specified by NIST), the circuit depth metrics (Toffoli depth, T -depth and full depth) become crucial factors and parallelization for often becomes necessary. We provide the least depth implementation in this respect that offers the best performance in terms of metrics like depth-squared - qubit count product, depth - gate count product.
- 8 April 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (1)
Open AccessQuantum Analysis of AES
Our work explores the key recovery attack using the Grover's search on the three variants of AES (-128, -192, -256). In total, we develop a pool of 26 implementations per AES variant (totaling 78), by taking the state-of-the-art advancements in the relevant fields into account. We present the least Toffoli depth and full depth implementations of AES, thereby improving from Zou et al.'s Asiacrypt'20 paper by more than 97 percent for each variant of AES. We show that the qubit count - Toffoli depth product is reduced from theirs by more than 87 percent. Furthermore, we analyze the Jaques et al.'s Eurocrypt'20 implementations in detail, fix the bugs (arising from some problem of the quantum computing tool used), and report corrected benchmarks (which seem to improve from the authors' own bug-fixing, thanks to our architecture consideration). To the best of our finding, our work improves from all the previous works (including the Asiacrypt'22 paper by Huang and Sun, the Asiacrypt'23 paper by Liu et al. and the Asiacrypt'24 paper by Shi and Feng) in terms of various quantum circuit complexity metrics. To be more precise, we estimate the currently best-known quantum attack complexities for AES-128 ( 2 156.2630 ), AES-192 ( 2 221.5801 ) and AES-256 ( 2 286.0731 ). Additionally, we achieve the least Toffoli depth - qubit count product for AES-128 ( 121920 , improving from 130720 by Shi and Feng in Asiacrypt'24), AES-192 ( 161664 , improving from 188880 by Liu et al. in Asiacrypt'23) and AES-256 ( 206528 , improving from 248024 by Liu et al. in Asiacrypt'23) so far. We further investigate the prospect of the Grover's search. We propose four new implementations of the S-box, one new implementation of the MixColumn; as well as five new architecture (one is motivated by the architecture by Jaques et al. in Eurocrypt'20, and the rest four are entirely our innovation). Under the MAXDEPTH constraint (specified by NIST), the circuit depth metrics (Toffoli depth, T -depth and full depth) become crucial factors and parallelization for often becomes necessary. We provide the least depth implementation in this respect that offers the best performance in terms of metrics like depth-squared - qubit count product, depth - gate count product.
- Open Access
- 2 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (7)
Quantum Circuit Implementation and Resource Analysis for Triple Data Encryption Standard (DES) (Triple-DES)
In this paper, various types of quantum circuits for DES components are proposed to analyze the trade-offs in quantum resources for both DES and TDES block ciphers. Specifically, multiple optimized structures within the DES framework are devised, and by integrating different elements from each type, 34 possible configurations for the DES block cipher are generated. The required quantum resources for these configurations are then estimated, identifying not only qubit-optimized and depth-optimized circuits but also those achieving a balanced trade-off between qubit and circuit depth. Building on these optimized DES designs, TDES circuits are constructed, and the corresponding cost of a Grover-based attack on the TDES is estimated.
- 2 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (7)
Open AccessQuantum Circuit Implementation and Resource Analysis for Triple Data Encryption Standard (DES) (Triple-DES)
In this paper, various types of quantum circuits for DES components are proposed to analyze the trade-offs in quantum resources for both DES and TDES block ciphers. Specifically, multiple optimized structures within the DES framework are devised, and by integrating different elements from each type, 34 possible configurations for the DES block cipher are generated. The required quantum resources for these configurations are then estimated, identifying not only qubit-optimized and depth-optimized circuits but also those achieving a balanced trade-off between qubit and circuit depth. Building on these optimized DES designs, TDES circuits are constructed, and the corresponding cost of a Grover-based attack on the TDES is estimated.
- Open Access
- 10 August 2024
- Published by MDPI AG in Electronics
- Vol. 13 (16) , 3167
Grover on Scrypt
This paper presents an optimized quantum circuit for the cryptographic algorithm. We applied various optimization techniques to reduce the DW cost, which is the product of the time and space complexity of quantum circuits. In our proposed method, the number of ancilla qubits was significantly reduced through the use of optimized inverse operations, while the depth was minimized by implementing parallel structures. For the SHA-256, we devised a structure that achieves a substantial reduction in the number of ancilla qubits with only a slight increase in quantum circuit depth. By cleaning the dirty ancilla qubits used in the previous round through inverse operations, we enabled their reuse in each subsequent round. Specifically, we reduced the number of 8128 ancilla qubits, achieving this with an increase of only 6 in the full depth of the quantum circuit. Additionally, within Salsa20/8 in SMix, we reused qubits through inverse operations and performed some operations in parallel to reduce both the number of qubits and the overall quantum circuit depth. Finally, our quantum circuit for demonstrates a significant reduction in the width (the number of qubits) with only a minimal increase in the full quantum circuit depth.- 10 August 2024
- Published by MDPI AG in Electronics
- Vol. 13 (16) , 3167
Open AccessGrover on Scrypt
This paper presents an optimized quantum circuit for the cryptographic algorithm. We applied various optimization techniques to reduce the DW cost, which is the product of the time and space complexity of quantum circuits. In our proposed method, the number of ancilla qubits was significantly reduced through the use of optimized inverse operations, while the depth was minimized by implementing parallel structures. For the SHA-256, we devised a structure that achieves a substantial reduction in the number of ancilla qubits with only a slight increase in quantum circuit depth. By cleaning the dirty ancilla qubits used in the previous round through inverse operations, we enabled their reuse in each subsequent round. Specifically, we reduced the number of 8128 ancilla qubits, achieving this with an increase of only 6 in the full depth of the quantum circuit. Additionally, within Salsa20/8 in SMix, we reused qubits through inverse operations and performed some operations in parallel to reduce both the number of qubits and the overall quantum circuit depth. Finally, our quantum circuit for demonstrates a significant reduction in the width (the number of qubits) with only a minimal increase in the full quantum circuit depth. - 11 January 2024
- Published by Springer Nature
- p. 324-337
Efficient Implementation of the Classic McEliece on ARMv8 Processors
- 11 January 2024
- Published by Springer Nature
- p. 324-337
Efficient Implementation of the Classic McEliece on ARMv8 Processors
- 11 January 2024
- Published by Springer Nature
- p. 338-348
Evaluating KpqC Algorithm Submissions: Balanced and Clean Benchmarking Approach
- 11 January 2024
- Published by Springer Nature
- p. 338-348
Evaluating KpqC Algorithm Submissions: Balanced and Clean Benchmarking Approach
- Open Access
- 31 October 2023
- Published by MDPI AG in Electronics
- Vol. 12 (21) , 4485
Optimized Quantum Circuit for Quantum Security Strength Analysis of Argon2
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.
- 31 October 2023
- Published by MDPI AG in Electronics
- Vol. 12 (21) , 4485
Open AccessOptimized Quantum Circuit for Quantum Security Strength Analysis of Argon2
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.