Kyunghwan Song
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kyunghwan Song has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Jaewon Jung
Department of Mathematics, Korea University, Seoul, Republic of Korea
1 shared publication - Jong-Do Park
Department of Mathematics and Research Institute for Basic Sciences, Kyung Hee University, Seoul, Korea
1 shared publication - WonTae Hwang
Department of Mathematics, Institute of Pure and Applied Mathematics, Jeonbuk National University, Baekje-daero, Deokjin-gu, Jeonju-si, Jeollabuk-do 54896, South Korea
1 shared publication
Latest Publications
- Open Access
- 9 May 2025
- Published by Universal Wiser Publisher Pte. Ltd in Contemporary Mathematics
- p. 2968-2986
A Study on Some Approximations on the Average Number of the LLL Bases in Higher Dimensions
The Lenstra-Lenstra-Lovász (LLL) algorithm, known as one of the main algorithms to decrypt the ciphertext encrypted by Lattice-based cryptography, outputs short basis vectors for n dimensional vectors represented by n × n matrix. One of the indicators that determine the quality of this LLL algorithm is the average number of the LLL bases, and there is a result related to the average number of the (δ, η)-LLL bases in dimension n in theoretical sense but the formula seems to be complicated and computing in high dimension takes a long time. In practical sense, we suggest some approximations which can be computed by just storing some constants and computing relatively simple exponential functions. To obtain the approximated results, we first express the existing results in a slightly simpler form, execute individual approximation for the part that takes a long time to calculate, and then combine the results. By finding the approximated value of the average number much faster, it helps to discuss the quality of the LLL algorithm for dimension n faster. Furthermore, in this process, we find a more precise upper bound of the average number of the (δ, η)-LLL bases in higher dimensions.
- 9 May 2025
- Published by Universal Wiser Publisher Pte. Ltd in Contemporary Mathematics
- p. 2968-2986
Open AccessA Study on Some Approximations on the Average Number of the LLL Bases in Higher Dimensions
The Lenstra-Lenstra-Lovász (LLL) algorithm, known as one of the main algorithms to decrypt the ciphertext encrypted by Lattice-based cryptography, outputs short basis vectors for n dimensional vectors represented by n × n matrix. One of the indicators that determine the quality of this LLL algorithm is the average number of the LLL bases, and there is a result related to the average number of the (δ, η)-LLL bases in dimension n in theoretical sense but the formula seems to be complicated and computing in high dimension takes a long time. In practical sense, we suggest some approximations which can be computed by just storing some constants and computing relatively simple exponential functions. To obtain the approximated results, we first express the existing results in a slightly simpler form, execute individual approximation for the part that takes a long time to calculate, and then combine the results. By finding the approximated value of the average number much faster, it helps to discuss the quality of the LLL algorithm for dimension n faster. Furthermore, in this process, we find a more precise upper bound of the average number of the (δ, η)-LLL bases in higher dimensions.
- Open Access
- 1 January 2022
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 20 (1) , 1642-1655
On the reciprocal sum of the fourth power of Fibonacci numbers
Let be the th Fibonacci number with . Recently, the exact values of have been obtained only for , where is the floor function. It has been an open problem for . In this article, we consider the case of and show that where .- 1 January 2022
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 20 (1) , 1642-1655
Open AccessOn the reciprocal sum of the fourth power of Fibonacci numbers
Let be the th Fibonacci number with . Recently, the exact values of have been obtained only for , where is the floor function. It has been an open problem for . In this article, we consider the case of and show that where .