Minho Song
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Minho Song has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Siwoo Eum
Department of Information Computer Engineering, Hansung University, Seoul 02876, Republic of Korea
5 shared publications - Hwajeong Seo
Department of Information Computer Engineering, Hansung University, Seoul 02876, Republic of Korea
4 shared publications - Ha-Gyeong Kim
Department of Information Computer Engineering, Hansung University, Seoul 02876, Republic of Korea
2 shared publications - Seung-Won Lee
Department of Information Computer Engineering, Hansung University, Seoul 02876, Republic of Korea
2 shared publications - Hyunjun Kim
Division of IT Convergence Engineering, Hansung University, Seoul 02876, Republic of Korea
1 shared publication - Minjoo Sim
Hansung University
1 shared publication
Latest Publications
- 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. 400-414
Maximizing ARIA-CTR Performance Through Kernel-Level Memory Optimization on the Apple M1 GPU
- 1 May 2026
- Published by Springer Nature
- p. 400-414
Maximizing ARIA-CTR Performance Through Kernel-Level Memory Optimization on the Apple M1 GPU
- 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
- 15 May 2025
- Published by MDPI AG in Electronics
- Vol. 14 (10) , 2021
Efficient GPU Parallel Implementation and Optimization of ARIA for Counter and Exhaustive Key-Search Modes
This paper proposes an optimized shared memory access technique to enhance parallel processing performance and reduce memory accesses for the ARIA block cipher in GPU environments. To overcome the limited size of GPU shared memory, we merged ARIA’s four separate S-box tables into a single unified 32-bit table, effectively reducing the total memory usage from 4 KB to 1 KB. This allowed the consolidated table to be replicated 32 times within the limited shared memory, efficiently resolving the memory-bank conflict issues frequently encountered during parallel execution. Additionally, we utilized CUDA’s built-in function __byte_perm() to efficiently reconstruct the desired outputs from the reduced unified table, without imposing additional computational overhead. In exhaustive key-search scenarios, we implemented an on-the-fly key-expansion method, significantly reducing the memory usage per thread and enhancing parallel processing efficiency. In the RTX 3060 environment, profiling was performed to accurately analyze shared memory efficiency and the performance degradation caused by bank conflicts, yielding detailed profiling results. The results of experiments conducted on the RTX 3060 Mobile and RTX 4080 GPUs demonstrated significant performance improvements over conventional methods. Notably, the RTX 4080 GPU achieved a maximum throughput of 1532.42 Gbps in ARIA-CTR mode, clearly validating the effectiveness and practical applicability of the proposed optimization techniques. On the RTX 3060, the performance of 128-bit ARIA-CTR was improved by 2.34× compared to previous state-of-the-art implementations. Furthermore, for exhaustive key searches on the 128-bit ARIA block cipher, a throughput of 1365.84 Gbps was achieved on the RTX 4080 GPU.
- 15 May 2025
- Published by MDPI AG in Electronics
- Vol. 14 (10) , 2021
Open AccessEfficient GPU Parallel Implementation and Optimization of ARIA for Counter and Exhaustive Key-Search Modes
This paper proposes an optimized shared memory access technique to enhance parallel processing performance and reduce memory accesses for the ARIA block cipher in GPU environments. To overcome the limited size of GPU shared memory, we merged ARIA’s four separate S-box tables into a single unified 32-bit table, effectively reducing the total memory usage from 4 KB to 1 KB. This allowed the consolidated table to be replicated 32 times within the limited shared memory, efficiently resolving the memory-bank conflict issues frequently encountered during parallel execution. Additionally, we utilized CUDA’s built-in function __byte_perm() to efficiently reconstruct the desired outputs from the reduced unified table, without imposing additional computational overhead. In exhaustive key-search scenarios, we implemented an on-the-fly key-expansion method, significantly reducing the memory usage per thread and enhancing parallel processing efficiency. In the RTX 3060 environment, profiling was performed to accurately analyze shared memory efficiency and the performance degradation caused by bank conflicts, yielding detailed profiling results. The results of experiments conducted on the RTX 3060 Mobile and RTX 4080 GPUs demonstrated significant performance improvements over conventional methods. Notably, the RTX 4080 GPU achieved a maximum throughput of 1532.42 Gbps in ARIA-CTR mode, clearly validating the effectiveness and practical applicability of the proposed optimization techniques. On the RTX 3060, the performance of 128-bit ARIA-CTR was improved by 2.34× compared to previous state-of-the-art implementations. Furthermore, for exhaustive key searches on the 128-bit ARIA block cipher, a throughput of 1365.84 Gbps was achieved on the RTX 4080 GPU.
- Open Access
- 16 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (16) , 9295
Optimized Implementation of Argon2 Utilizing the Graphics Processing Unit
In modern information technology systems, secure storage and transmission of personal and sensitive data are recognized as important tasks. These requirements are achieved through secure and robust encryption methods. Argon2 is an advanced cryptographic algorithm that emerged as the winner in the Password Hashing Competition (PHC), offering a concrete and secure measure. Argon2 also provides a secure mechanism against side-channel attacks and cracking attacks using parallel processing (e.g., GPU). In this paper, we analyze the existing GPU-based implementation of the Argon2 algorithm and further optimize the implementation by improving the performance of the hashing function during the computation process. The proposed method focuses on enhancing performance by distributing tasks between CPU and GPU units, reducing the data transfer cost for efficient GPU-based parallel processing. By shifting several stages from the CPU to the GPU, the data transfer cost is significantly reduced, resulting in faster processing times, particularly when handling a larger number of passwords and higher levels of parallelism. Additionally, we optimize the utilization of the GPU’s shared memory, which enhances memory access speed, especially in the computation of the hash value generation process. Furthermore, we leverage the parallel processing capabilities of the GPU to perform efficient brute-force attacks. By computing the H function on the GPU, the proposed implementation can generate initial blocks for multiple inputs in a single operation, making brute-force attacks in an efficient way. The proposed implementation outperforms existing methods, especially when processing a larger number of passwords and operating at higher levels of parallelism.
- 16 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (16) , 9295
Open AccessOptimized Implementation of Argon2 Utilizing the Graphics Processing Unit
In modern information technology systems, secure storage and transmission of personal and sensitive data are recognized as important tasks. These requirements are achieved through secure and robust encryption methods. Argon2 is an advanced cryptographic algorithm that emerged as the winner in the Password Hashing Competition (PHC), offering a concrete and secure measure. Argon2 also provides a secure mechanism against side-channel attacks and cracking attacks using parallel processing (e.g., GPU). In this paper, we analyze the existing GPU-based implementation of the Argon2 algorithm and further optimize the implementation by improving the performance of the hashing function during the computation process. The proposed method focuses on enhancing performance by distributing tasks between CPU and GPU units, reducing the data transfer cost for efficient GPU-based parallel processing. By shifting several stages from the CPU to the GPU, the data transfer cost is significantly reduced, resulting in faster processing times, particularly when handling a larger number of passwords and higher levels of parallelism. Additionally, we optimize the utilization of the GPU’s shared memory, which enhances memory access speed, especially in the computation of the hash value generation process. Furthermore, we leverage the parallel processing capabilities of the GPU to perform efficient brute-force attacks. By computing the H function on the GPU, the proposed implementation can generate initial blocks for multiple inputs in a single operation, making brute-force attacks in an efficient way. The proposed implementation outperforms existing methods, especially when processing a larger number of passwords and operating at higher levels of parallelism.