Soonhak Kwon

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 22

Top Topics

Prime Implicants

Descending Order

Boolean Functions

Top Venues

Finite Fields Their Appl.

IACR Cryptol. ePrint Arch.

Des. Codes Cryptogr.

Publications

Jaeseong Jeong, Namhun Koo, Soonhak Kwon
The second-order zero differential uniformity of the swapped inverse functions over finite fields. CoRR (2024)
Nhan-Phu Chung, Jaeseong Jeong, Namhun Koo, Soonhak Kwon
cc-differential uniformity, (almost) perfect cc-nonlinearity, and equivalences. CoRR (2023)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
. CoRR (2023)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
-differential uniformity of permutations with Carlitz rank 3. Finite Fields Their Appl. 86 (2023)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
On non-monomial APcN permutations over finite fields of even characteristic. Finite Fields Their Appl. 89 (2023)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
Low c-differential uniformity of the swapped inverse function in odd characteristic. Discret. Appl. Math. 336 (2023)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
On the boomerang uniformity of permutations of low Carlitz rank. Finite Fields Their Appl. 81 (2022)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
Low c-Differential Uniformity of the Swapped Inverse Function in Odd Characteristic. CoRR (2022)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
New differentially 4-uniform permutations from modifications of the inverse function. Finite Fields Their Appl. 77 (2022)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
Investigations of c-Differential Uniformity of Permutations with Carlitz Rank 3. CoRR (2022)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
On non-monimial APcN permutations over finite fields of even characteristic. CoRR (2022)
Jaeseong Jeong, Chang Heon Kim, Namhun Koo, Soonhak Kwon, Sumin Lee
). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (8) (2022)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
Constructing differentially 4-uniform involutions over F22k by using Carlitz form. Finite Fields Their Appl. 78 (2022)
Lilya Budaghyan, Nikolay S. Kaleyski, Soonhak Kwon, Constanza Riera, Pantelimon Stanica
Partially APN Boolean functions and classes of functions that are not APN infinitely often. Cryptogr. Commun. 12 (3) (2020)
Jaeseong Jeong, Namhun Koo, Soonhak Kwon
On the Boomerang Uniformity of Permutations of Low Carlitz Rank. CoRR (2020)
Gook Hwa Cho, Soonhak Kwon, Hyang-Sook Lee
A refinement of Müller's cube root algorithm. Finite Fields Their Appl. 67 (2020)
Lilya Budaghyan, Nikolay S. Kaleyski, Soonhak Kwon, Constanza Riera, Pantelimon Stanica
Partially APN Boolean functions and classes of functions that are not APN infinitely often. CoRR (2019)
Jaeseong Jeong, Chang Heon Kim, Namhun Koo, Soonhak Kwon, Sumin Lee
. IACR Cryptol. ePrint Arch. 2019 (2019)
Gook Hwa Cho, Byeonghwan Go, Chang Heon Kim, Namhun Koo, Soonhak Kwon
On the Cipolla-Lehmer type algorithms in finite fields. Appl. Algebra Eng. Commun. Comput. 30 (2) (2019)
Namhun Koo, Gook Hwa Cho, Soonhak Kwon
) with 0<l<r and Small s. IEEE Trans. Computers 65 (1) (2016)
Namhun Koo, Gook Hwa Cho, Byeonghwan Go, Soonhak Kwon
An Improvement of the Cipolla-Lehmer Type Algorithms. CoRR (2015)
Gook Hwa Cho, Namhun Koo, Eunhye Ha, Soonhak Kwon
New cube root algorithm based on the third order linear recurrence relations in finite fields. Des. Codes Cryptogr. 75 (3) (2015)
Geon Heo, Seokhwan Choi, Kwang Ho Lee, Namhun Koo, Soonhak Kwon
. IACR Cryptol. ePrint Arch. 2014 (2014)
Gook Hwa Cho, Namhun Koo, Eunhye Ha, Soonhak Kwon
New Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field. IACR Cryptol. ePrint Arch. 2013 (2013)
Gook Hwa Cho, Namhun Koo, Eunhye Ha, Soonhak Kwon
Trace Expression of r-th Root over Finite Field. IACR Cryptol. ePrint Arch. 2013 (2013)
Namhun Koo, Gook Hwa Cho, Soonhak Kwon
). IACR Cryptol. ePrint Arch. 2013 (2013)
Namhun Koo, Gook Hwa Cho, Soonhak Kwon
) with 0 < l < r and Small s. IACR Cryptol. ePrint Arch. 2013 (2013)
Namhun Koo, Gooc Hwa Jo, Soonhak Kwon
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve. IACR Cryptol. ePrint Arch. 2011 (2011)
Kris Gaj, Soonhak Kwon, Patrick Baier, Paul Kohlbrenner, Hoang Le, Mohammed Khaleeluddin, Ramakrishna Bachimanchi, Marcin Rogawski
Area-Time Efficient Implementation of the Elliptic Curve Method of Factoring in Reconfigurable Hardware for Application in the Number Field Sieve. IEEE Trans. Computers 59 (9) (2010)
Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong
) using LSB first algorithm with irreducible polynomials and trinomials. Comput. Electr. Eng. 35 (1) (2009)
Chang Shu, Soonhak Kwon, Kris Gaj
Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields. IEEE Trans. Computers 58 (9) (2009)
Miaoqing Huang, Kris Gaj, Soonhak Kwon, Tarek A. El-Ghazawi
An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm. Public Key Cryptography (2008)
Taek-Young Youn, Young-Ho Park, Taekyoung Kwon, Soonhak Kwon, Jongin Lim
Efficient Flexible Batch Signing Techniques for Imbalanced Communication Applications. IEICE Trans. Inf. Syst. (5) (2008)
Chang Shu, Soonhak Kwon, Kris Gaj
FPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials. IET Comput. Digit. Tech. 2 (1) (2008)
Soonhak Kwon, Taekyoung Kwon, Young-Ho Park
) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (1) (2008)
Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong
FPGA implementation of high performance elliptic curve cryptographic processor over GF. J. Syst. Archit. 54 (10) (2008)
Miaoqing Huang, Kris Gaj, Soonhak Kwon, Tarek A. El-Ghazawi
An Optimized Hardware Architecture of Montgomery Multiplication Algorithm. IACR Cryptol. ePrint Arch. 2007 (2007)
Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong
Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields. Des. Codes Cryptogr. 41 (3) (2006)
Chang Shu, Soonhak Kwon, Kris Gaj
FPGA Accelerated Tate Pairing Based Cryptosystems over Binary Fields. IACR Cryptol. ePrint Arch. 2006 (2006)
Kris Gaj, Soonhak Kwon, Patrick Baier, Paul Kohlbrenner, Hoang Le, Mohammed Khaleeluddin, Ramakrishna Bachimanchi
Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware. CHES (2006)
Chang Shu, Soonhak Kwon, Kris Gaj
FPGA accelerated tate pairing based cryptosystems over binary fields. FPT (2006)
Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong
) for High Speed Cryptographic Processors. ICCSA (1) (2005)
Chang Hoon Kim, Chun Pyo Hong, Soonhak Kwon
) for Low Cost Cryptographic Applications. HPCC (2005)
Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong, In-Gil Nam
) Applications. HPCC (2005)
Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong
). ASP-DAC (2005)
Soonhak Kwon, Taekyoung Kwon, Young-Ho Park
Efficient Linear Array for Multiplication over NIST Recommended Binary Fields. WILF (2005)
Soonhak Kwon, Chang Kim, Chun Pyo Hong
) Using LSB First Algorithm. WILF (2005)
Soonhak Kwon, Taekyoung Kwon, Young-Ho Park
) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography. ICISC (2005)
Soonhak Kwon
Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields. ACISP (2005)
Chang Hoon Kim, Chun Pyo Hong, Soonhak Kwon
). IEEE Trans. Very Large Scale Integr. Syst. 13 (4) (2005)
Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong, Hiecheol Kim
). ICCSA (3) (2004)
Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong
Fast Irreducibility Testing for XTR Using a Gaussian Normal Basis of Low Complexity. Selected Areas in Cryptography (2004)
Soonhak Kwon
) Using a Gaussian Normal Basis of Type II. WISA (2004)
Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong
) for High Speed Cryptographic Processors. ICCSA (4) (2004)
Soonhak Kwon
Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields. IACR Cryptol. ePrint Arch. 2004 (2004)
Soonhak Kwon, Kris Gaj, Chang Hoon Kim, Chun Pyo Hong
) Using a Normal Basis for Elliptic Curve Cryptography. CHES (2004)
Chang Hoon Kim, Soonhak Kwon, Jong Jin Kim, Chun Pyo Hong
A Compact and Fast Division Architecture for a Finite Field. ICCSA (1) (2003)
Soonhak Kwon
A Low Complexity and a Low Latency Bit Parallel Systolic Multiplier over GF(2m) Using an Optimal Normal Basis of Type II. IEEE Symposium on Computer Arithmetic (2003)
Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong
Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic. ISAAC (2003)
Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong
) Determined by Gauss Periods. CHES (2003)
Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong
) which is as efficient as the one with MSB first algorithm. ISCAS (5) (2003)
Soonhak Kwon, Heuisu Ryu
) for a Class of Finite Fields. ICOIN (2003)
Chang Hoon Kim, Soonhak Kwon, Jong Jin Kim, Chun Pyo Hong
) for Reconfigurable Hardware Implementation. FPL (2003)
Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong, In-Gil Nam
). ISCAS (2) (2003)
Soonhak Kwon, Heuisu Ryu
). ISC (2002)
Soonhak Kwon
) for Three Classes of Finite Fields. ICICS (2002)
Ganghwa Lee, Yoonchul Lee, SukGyu Lee, Soonhak Kwon
Majority-Voting FCM Algorithm in the Vague Fuzzy Classification. FUZZ-IEEE (2001)