Hwajeong Seo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hwajeong Seo has a total of 194 co-authors. Here are the top co-authors by number of shared publications:
- Howon Kim
School of Computer Science and Engineering, Pusan National University, Busan 46241, Republic of Korea
46 shared publications - Kyungbae Jang
Hansung University
35 shared publications - Siwoo Eum
Department of Information Computer Engineering, Hansung University, Seoul 02876, Republic of Korea
25 shared publications - Gyeongju Song
Hansung University
22 shared publications - Minjoo Sim
Hansung University
19 shared publications - Hyeokdong Kwon
Division of IT Convergence Engineering, Hansung University, Seoul 02876, Korea
17 shared publications
Latest Publications
- Open Access
- 1 November 2026
- Published by MDPI AG in Electronics
- Vol. 15 (21) , 5068
CT-KAT: Beyond Pass/Fail in Constant-Time Screening of PQC Implementations
Constant-time screening of post-quantum cryptographic implementations must simultaneously examine secret-dependent execution structure, binary instructions, and timing. Because tests observe different phenomena, no single result supports assessment. We present CT-KAT, which generates test harnesses from configurations and connects functional validation, structural analysis across builds, instruction scanning, and timing measurements. CT-KAT records measurement validity, input relationships, and manual-review status, withholding a no-issue status when evidence is insufficient. We evaluate 25 target-operation pairs and 206 build combinations from 24 pairs with build artifacts. Structural-review targets increase from 11 under one deployment build to 13 across the full matrix; instruction scanning expands the review set to 22. Three of 28 timing comparisons show repeatable differences, but all change public and secret values together. In KyberSlash, structural tests show no signal while binary evidence identifies secret-related divisions. Thus, evidence must be preserved with its interpretation conditions.
- 1 November 2026
- Published by MDPI AG in Electronics
- Vol. 15 (21) , 5068
Open AccessCT-KAT: Beyond Pass/Fail in Constant-Time Screening of PQC Implementations
Constant-time screening of post-quantum cryptographic implementations must simultaneously examine secret-dependent execution structure, binary instructions, and timing. Because tests observe different phenomena, no single result supports assessment. We present CT-KAT, which generates test harnesses from configurations and connects functional validation, structural analysis across builds, instruction scanning, and timing measurements. CT-KAT records measurement validity, input relationships, and manual-review status, withholding a no-issue status when evidence is insufficient. We evaluate 25 target-operation pairs and 206 build combinations from 24 pairs with build artifacts. Structural-review targets increase from 11 under one deployment build to 13 across the full matrix; instruction scanning expands the review set to 22. Three of 28 timing comparisons show repeatable differences, but all change public and secret values together. In KyberSlash, structural tests show no signal while binary evidence identifies secret-related divisions. Thus, evidence must be preserved with its interpretation conditions.
- Open Access
- 25 September 2026
- Published by MDPI AG in Electronics
- Vol. 15 (19) , 4428
An Evidence-Gated KCMVP Pre-Certification Decision-Support Prototype: Rule-Based Analysis, Evidence Retrieval, and Constrained LLM Review
The Korean Cryptographic Module Validation Program (KCMVP) requires the joint review of source code, submission documents, and their traceability. This study presents an evidence-gated decision-support prototype combining rule-based candidate generation (L1), rule-bound evidence retrieval (L2), program-fact verification, and constrained LLM-assisted review (L3). Its 166 YAML rule assets, comprising 97 code rules, 65 document rules, and four traceability rules, were developed with reference to official KCMVP procedures and National Intelligence Service guidance on submission preparation and cryptographic algorithm implementation. On an LEA-centered development corpus, L1 matched 115 of 128 author-annotated positive file–rule pairs (89.84%). However, because these annotations were created during system development, independent expert validation is required before interpreting this value as detection accuracy. In nine source-derived mutation groups, the baseline and improved-evidence conditions each produced six binary dispositions and three holds (exact McNemar test, ). This result defines the current role of L2 as supplying traceable evidence, validating citations, and withholding unsupported decisions rather than independently determining compliance. L3 reviews only residual candidates supported by validated evidence and program facts under a structured output contract; failure to satisfy input, evidence, citation, or output-validation conditions results in a hold. Overall, the results demonstrate a feasible and auditable architecture that preserves evidence provenance and explicitly holds unresolved cases instead of forcing unsupported decisions.- 25 September 2026
- Published by MDPI AG in Electronics
- Vol. 15 (19) , 4428
Open AccessAn Evidence-Gated KCMVP Pre-Certification Decision-Support Prototype: Rule-Based Analysis, Evidence Retrieval, and Constrained LLM Review
The Korean Cryptographic Module Validation Program (KCMVP) requires the joint review of source code, submission documents, and their traceability. This study presents an evidence-gated decision-support prototype combining rule-based candidate generation (L1), rule-bound evidence retrieval (L2), program-fact verification, and constrained LLM-assisted review (L3). Its 166 YAML rule assets, comprising 97 code rules, 65 document rules, and four traceability rules, were developed with reference to official KCMVP procedures and National Intelligence Service guidance on submission preparation and cryptographic algorithm implementation. On an LEA-centered development corpus, L1 matched 115 of 128 author-annotated positive file–rule pairs (89.84%). However, because these annotations were created during system development, independent expert validation is required before interpreting this value as detection accuracy. In nine source-derived mutation groups, the baseline and improved-evidence conditions each produced six binary dispositions and three holds (exact McNemar test, ). This result defines the current role of L2 as supplying traceable evidence, validating citations, and withholding unsupported decisions rather than independently determining compliance. L3 reviews only residual candidates supported by validated evidence and program facts under a structured output contract; failure to satisfy input, evidence, citation, or output-validation conditions results in a hold. Overall, the results demonstrate a feasible and auditable architecture that preserves evidence provenance and explicitly holds unresolved cases instead of forcing unsupported decisions. - 10 August 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (10) , 618
LW-YOLOv5: lightweight CNN model for PCB defect detection based on YOLOv5
- 10 August 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (10) , 618
LW-YOLOv5: lightweight CNN model for PCB defect detection based on YOLOv5
- Open Access
- 10 July 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (14) , 6953
Anonymous E-Voting on Hyperledger Fabric: Practical Mitigation of the Verification Paradox and Coercion Resistance
Electronic voting systems inherently encompass a structural tension among ballot secrecy, verifiability, and coercion resistance. Voters must be able to verify whether their votes have been included; however, if such verification information can serve as evidence presentable to a third party, it becomes a basis for post-election intimidation. Existing studies have focused primarily on performance evaluation or data separation, and have not comprehensively addressed the structural tension between verifiability and coercion resistance. This study defines this tension as the verification paradox and designs and implements an electronic voting prototype on a three-organization consortium based on Hyperledger Fabric 2.5, combining a 2-of-3 endorsement policy, nullifier-based anonymity, Exponential ElGamal homomorphic tallying, zero-knowledge proof (ZKP)-based ballot validity verification, panic-password-based deniable verification, and Private Data Collection (PDC)-based coerced vote separation. Quantitative evaluation results confirm a server latency overhead of +0.9% for ElGamal relative to the AES performance baseline, statistical indistinguishability between normal and panic responses (), and a peak throughput of approximately 40.7 TPS (with an error rate of 0%) under 1000 concurrent voters. Through this prototype implementation and quantitative evaluation, we show the potential of permissioned blockchains to partially and practically mitigate the verification paradox. This study, however, does not provide a formal security proof, and it is subject to a trust assumption on PDC as well as to the experimental limitations of a single evaluation environment and a limited load range.- 10 July 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (14) , 6953
Open AccessAnonymous E-Voting on Hyperledger Fabric: Practical Mitigation of the Verification Paradox and Coercion Resistance
Electronic voting systems inherently encompass a structural tension among ballot secrecy, verifiability, and coercion resistance. Voters must be able to verify whether their votes have been included; however, if such verification information can serve as evidence presentable to a third party, it becomes a basis for post-election intimidation. Existing studies have focused primarily on performance evaluation or data separation, and have not comprehensively addressed the structural tension between verifiability and coercion resistance. This study defines this tension as the verification paradox and designs and implements an electronic voting prototype on a three-organization consortium based on Hyperledger Fabric 2.5, combining a 2-of-3 endorsement policy, nullifier-based anonymity, Exponential ElGamal homomorphic tallying, zero-knowledge proof (ZKP)-based ballot validity verification, panic-password-based deniable verification, and Private Data Collection (PDC)-based coerced vote separation. Quantitative evaluation results confirm a server latency overhead of +0.9% for ElGamal relative to the AES performance baseline, statistical indistinguishability between normal and panic responses (), and a peak throughput of approximately 40.7 TPS (with an error rate of 0%) under 1000 concurrent voters. Through this prototype implementation and quantitative evaluation, we show the potential of permissioned blockchains to partially and practically mitigate the verification paradox. This study, however, does not provide a formal security proof, and it is subject to a trust assumption on PDC as well as to the experimental limitations of a single evaluation environment and a limited load range. - Open Access
- 8 July 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (14) , 6846
Advanced Vector Extensions 512 Acceleration of LSH and LEA-GCM
This paper presents high-performance Advanced Vector Extensions 512 (AVX-512) implementations of two Korean standard cryptographic algorithms: the Lightweight Secure Hash (LSH) function and Lightweight Encryption Algorithm–Galois/Counter Mode (LEA-GCM) authenticated encryption. For LSH, we apply three optimization strategies: single-message processing using AVX-512 512-bit vector registers, dual-message parallel processing through register interleaving, and multi-core parallelization using a dynamic queue-based pthread thread pool. For LEA-GCM, we propose an end-to-end optimization that replaces scalar counter-mode (CTR) encryption with 16-block AVX-512 parallel processing and Streaming SIMD Extensions(SSE)-based Galois Hash (GHASH) authentication with VPCLMULQDQ-based four-block parallel processing. Performance evaluation on an Intel Core i7-1165G7 (Tiger Lake) processor shows that LSH-256 achieves an average of 1.16× throughput improvement and LSH-512 achieves an average of 1.61× improvement over the Korea Internet and Security Agency (KISA) AVX2 reference implementation. Dual-message interleaving achieves an average superlinear speedup of 2.28×, driven by instruction-level parallelism (ILP), and the thread pool delivers speedups of 3.73× to 5.13× across eight logical cores (four physical cores with hyperthreading). The optimized LEA-GCM implementation achieves a 3.26× throughput improvement over the KISA SSE-based reference and a 12.1× improvement over the pure software implementation for 4096-byte inputs, with correctness verified against KISA official test vectors.
- 8 July 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (14) , 6846
Open AccessAdvanced Vector Extensions 512 Acceleration of LSH and LEA-GCM
This paper presents high-performance Advanced Vector Extensions 512 (AVX-512) implementations of two Korean standard cryptographic algorithms: the Lightweight Secure Hash (LSH) function and Lightweight Encryption Algorithm–Galois/Counter Mode (LEA-GCM) authenticated encryption. For LSH, we apply three optimization strategies: single-message processing using AVX-512 512-bit vector registers, dual-message parallel processing through register interleaving, and multi-core parallelization using a dynamic queue-based pthread thread pool. For LEA-GCM, we propose an end-to-end optimization that replaces scalar counter-mode (CTR) encryption with 16-block AVX-512 parallel processing and Streaming SIMD Extensions(SSE)-based Galois Hash (GHASH) authentication with VPCLMULQDQ-based four-block parallel processing. Performance evaluation on an Intel Core i7-1165G7 (Tiger Lake) processor shows that LSH-256 achieves an average of 1.16× throughput improvement and LSH-512 achieves an average of 1.61× improvement over the Korea Internet and Security Agency (KISA) AVX2 reference implementation. Dual-message interleaving achieves an average superlinear speedup of 2.28×, driven by instruction-level parallelism (ILP), and the thread pool delivers speedups of 3.73× to 5.13× across eight logical cores (four physical cores with hyperthreading). The optimized LEA-GCM implementation achieves a 3.26× throughput improvement over the KISA SSE-based reference and a 12.1× improvement over the pure software implementation for 4096-byte inputs, with correctness verified against KISA official test vectors.
- 1 May 2026
- Published by Springer Nature
- p. 182-197
Quantum Implementation of SHA-1
- 1 May 2026
- Published by Springer Nature
- p. 171-181
Depth-Optimized Quantum Implementation of CHAM
- 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
- 13 April 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (8) , 3782
Accelerating FAEST Signatures on ARM: NEON SIMD AES and Parallel VOLE Optimization
FAEST is a National Institute of Standards and Technology post-quantum signature candidate based on the Vector Oblivious Linear Evaluation-in-the-Head paradigm, whose signing performance is dominated by repeated Advanced Encryption Standard Counter-based Pseudorandom Generator calls. The reference implementation provides no FAEST-specialized acceleration for Advanced RISC Machine platforms. This paper proposes a three-layer Advanced Reduced Instruction Set Computer Machine NEON Single Instruction Multiple Data optimization: a register-resident 256-byte S-box with Table Lookup/Table Lookup with Extension-based SubBytes and four-way/eight-way parallel Advanced Encryption Standard processing; a fixed-length Pseudorandom Generator specialized for the FAEST tree structure; and Portable Operating System Interface for Unix thread-based parallelization of independent Vector Oblivious Linear Evaluation instances. Evaluated on all 12 parameter sets of FAEST v2 on Raspberry Pi 4 (without Advanced Reduced Instruction Set Computer Machine version 8 crypto-extensions) and Apple M2 (with hardware Advanced Encryption Standard support), the proposed method achieves signing speedups of up to 136.9x on Raspberry Pi 4 and 330.1x on Apple M2 over the pure-C reference. On Raspberry Pi 4, the NEON implementation outperforms OpenSSL; on Apple M2, the NEON-plus-Portable Operating System Interface for Unix thread configuration outperforms hardware-accelerated OpenSSL across all parameters, confirming that NEON SIMD combined with task-level parallelization can exceed hardware-accelerated single-thread throughput on Advanced Reduced Instruction Set Computer Machine-based platforms.
- 13 April 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (8) , 3782
Open AccessAccelerating FAEST Signatures on ARM: NEON SIMD AES and Parallel VOLE Optimization
FAEST is a National Institute of Standards and Technology post-quantum signature candidate based on the Vector Oblivious Linear Evaluation-in-the-Head paradigm, whose signing performance is dominated by repeated Advanced Encryption Standard Counter-based Pseudorandom Generator calls. The reference implementation provides no FAEST-specialized acceleration for Advanced RISC Machine platforms. This paper proposes a three-layer Advanced Reduced Instruction Set Computer Machine NEON Single Instruction Multiple Data optimization: a register-resident 256-byte S-box with Table Lookup/Table Lookup with Extension-based SubBytes and four-way/eight-way parallel Advanced Encryption Standard processing; a fixed-length Pseudorandom Generator specialized for the FAEST tree structure; and Portable Operating System Interface for Unix thread-based parallelization of independent Vector Oblivious Linear Evaluation instances. Evaluated on all 12 parameter sets of FAEST v2 on Raspberry Pi 4 (without Advanced Reduced Instruction Set Computer Machine version 8 crypto-extensions) and Apple M2 (with hardware Advanced Encryption Standard support), the proposed method achieves signing speedups of up to 136.9x on Raspberry Pi 4 and 330.1x on Apple M2 over the pure-C reference. On Raspberry Pi 4, the NEON implementation outperforms OpenSSL; on Apple M2, the NEON-plus-Portable Operating System Interface for Unix thread configuration outperforms hardware-accelerated OpenSSL across all parameters, confirming that NEON SIMD combined with task-level parallelization can exceed hardware-accelerated single-thread throughput on Advanced Reduced Instruction Set Computer Machine-based platforms.
- 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.