Majority-Voting FCM Algorithm in the Vague Fuzzy Classification. - Ganghwa Lee; Yoonchul Lee; SukGyu Lee; Soonhak Kwon (FUZZ-IEEE, 2001)

Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields. - Soonhak Kwon (ICICS, 2002)

Efficient Bit Serial Multiplication Using Optimal Normal Bases of Type II in GF (2m). - Soonhak Kwon; Heuisu Ryu (ISC, 2002)

A Low Complexity and a Low Latency Bit Parallel Systolic Multiplier over GF(2m) Using an Optimal Normal Basis of Type II. - Soonhak Kwon (IEEE Symposium on Computer Arithmetic, 2003)

Efficient Exponentiation for a Class of Finite Fields GF(2 n) Determined by Gauss Periods. - Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong (CHES, 2003)

A New Arithmetic Unit in GF(2m) for Reconfigurable Hardware Implementation. - Chang Hoon Kim; Soonhak Kwon; Jong Jin Kim; Chun Pyo Hong (FPL, 2003)

A Compact and Fast Division Architecture for a Finite Field. - Chang Hoon Kim; Soonhak Kwon; Jong Jin Kim; Chun Pyo Hong (ICCSA (1), 2003)

Efficient Bit Serial Multiplication in GF(2m) for a Class of Finite Fields. - Soonhak Kwon; Heuisu Ryu (ICOIN, 2003)

Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic. - Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong (ISAAC, 2003)

Efficient bit-serial systolic array for division over GF(2m). - Chang Hoon Kim; Soonhak Kwon; Chun Pyo Hong; In-Gil Nam (ISCAS (2), 2003)

A systolic multiplier with LSB first algorithm over GF(2m) which is as efficient as the one with MSB first algorithm. - Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong (ISCAS (5), 2003)

Efficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography. - Soonhak Kwon; Kris Gaj; Chang Hoon Kim; Chun Pyo Hong (CHES, 2004)

A New Systolic Array for Least Significant Digit First Multiplication in GF(2m). - Chang Hoon Kim; Soonhak Kwon; Chun Pyo Hong; Hiecheol Kim (ICCSA (3), 2004)

A Linear Systolic Array for Multiplication in GF(2m) for High Speed Cryptographic Processors. - Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong (ICCSA (4), 2004)

Fast Irreducibility Testing for XTR Using a Gaussian Normal Basis of Low Complexity. - Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong (Selected Areas in Cryptography, 2004)

Signed Digit Representation with NAF and Balanced Ternary Form and Efficient Exponentiation in GF(qn) Using a Gaussian Normal Basis of Type II. - Soonhak Kwon (WISA, 2004)

Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields. - Soonhak Kwon (IACR Cryptol. ePrint Arch., 2004)

Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields. - Soonhak Kwon (ACISP, 2005)

A fast digit-serial systolic multiplier for finite field GF(2m). - Chang Hoon Kim; Soonhak Kwon; Chun Pyo Hong (ASP-DAC, 2005)

A Novel Arithmetic Unit over GF(2m) for Low Cost Cryptographic Applications. - Chang Hoon Kim; Chun Pyo Hong; Soonhak Kwon (HPCC, 2005)

A New Digit-Serial Systolic Mulitplier for High Performance GF(2m) Applications. - Chang Hoon Kim; Soonhak Kwon; Chun Pyo Hong; In-Gil Nam (HPCC, 2005)

Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2m) for High Speed Cryptographic Processors. - Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong (ICCSA (1), 2005)

New Architecture for Multiplication in GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography. - Soonhak Kwon; Taekyoung Kwon 002; Young-Ho Park 001 (ICISC, 2005)

Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2m) Using LSB First Algorithm. - Soonhak Kwon; Chang Kim; Chun Pyo Hong (WILF, 2005)

Efficient Linear Array for Multiplication over NIST Recommended Binary Fields. - Soonhak Kwon; Taekyoung Kwon 002; Young-Ho Park 001 (WILF, 2005)

A digit-serial multiplier for finite field GF(2m). - Chang Hoon Kim; Chun Pyo Hong; Soonhak Kwon (IEEE Trans. Very Large Scale Integr. Syst., 2005)

Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware. - Kris Gaj; Soonhak Kwon; Patrick Baier; Paul Kohlbrenner; Hoang Le; Mohammed Khaleeluddin; Ramakrishna Bachimanchi (CHES, 2006)

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields. - Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong (Des. Codes Cryptogr., 2006)

FPGA Accelerated Tate Pairing Based Cryptosystems over Binary Fields. - Chang Shu 003; Soonhak Kwon; Kris Gaj (IACR Cryptol. ePrint Arch., 2006)

An Optimized Hardware Architecture of Montgomery Multiplication Algorithm. - Miaoqing Huang; Kris Gaj; Soonhak Kwon; Tarek A. El-Ghazawi (IACR Cryptol. ePrint Arch., 2007)

New Hardware Architecture for Multiplication over GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography. - Soonhak Kwon; Taekyoung Kwon 002; Young-Ho Park 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Efficient Flexible Batch Signing Techniques for Imbalanced Communication Applications. - Taek-Young Youn; Young-Ho Park 001; Taekyoung Kwon 002; Soonhak Kwon; Jongin Lim 001 (IEICE Trans. Inf. Syst., 2008)

FPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials. - Chang Shu 003; Soonhak Kwon; Kris Gaj (IET Comput. Digit. Tech., 2008)

FPGA implementation of high performance elliptic curve cryptographic processor over GF. - Chang Hoon Kim; Soonhak Kwon; Chun Pyo Hong (J. Syst. Archit., 2008)

More efficient systolic arrays for multiplication in GF(2m) using LSB first algorithm with irreducible polynomials and trinomials. - Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong (Comput. Electr. Eng., 2009)

Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields. - Chang Shu 003; Soonhak Kwon; Kris Gaj (IEEE Trans. Computers, 2009)

Area-Time Efficient Implementation of the Elliptic Curve Method of Factoring in Reconfigurable Hardware for Application in the Number Field Sieve. - Kris Gaj; Soonhak Kwon; Patrick Baier; Paul Kohlbrenner; Hoang Le; Mohammed Khaleeluddin; Ramakrishna Bachimanchi; Marcin Rogawski (IEEE Trans. Computers, 2010)

On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve. - Namhun Koo; Gooc Hwa Jo; Soonhak Kwon (IACR Cryptol. ePrint Arch., 2011)

New Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field. - Gook Hwa Cho; Namhun Koo; Eunhye Ha; Soonhak Kwon (IACR Cryptol. ePrint Arch., 2013)

Trace Expression of r-th Root over Finite Field. - Gook Hwa Cho; Namhun Koo; Eunhye Ha; Soonhak Kwon (IACR Cryptol. ePrint Arch., 2013)

Square Root Algorithm in Fq for q≡2s+1 (mod 2s+1). - Namhun Koo; Gook Hwa Cho; Soonhak Kwon (IACR Cryptol. ePrint Arch., 2013)

Remarks on the Pocklington and Padró-Sáez Cube Root Algorithm in 𝔽q. - Geon Heo; Seokhwan Choi; Kwang Ho Lee; Namhun Koo; Soonhak Kwon (IACR Cryptol. ePrint Arch., 2014)

An Improvement of the Cipolla-Lehmer Type Algorithms. - Namhun Koo; Gook Hwa Cho; Byeonghwan Go; Soonhak Kwon (CoRR, 2015)

New cube root algorithm based on the third order linear recurrence relations in finite fields. - Gook Hwa Cho; Namhun Koo; Eunhye Ha; Soonhak Kwon (Des. Codes Cryptogr., 2015)

On r-th Root Extraction Algorithm in 𝔽q for q≍lrs+1;(mod; rs+1) with 0<l<r and Small s. - Namhun Koo; Gook Hwa Cho; Soonhak Kwon (IEEE Trans. Computers, 2016)

On the Cipolla-Lehmer type algorithms in finite fields. - Gook Hwa Cho; Byeonghwan Go; Chang Heon Kim; Namhun Koo; Soonhak Kwon (Appl. Algebra Eng. Commun. Comput., 2019)

On cryptographic parameters of permutation polynomials of the form xrh(x(q-1)/d). - Jaeseong Jeong; Chang Heon Kim; Namhun Koo; Soonhak Kwon; Sumin Lee (IACR Cryptol. ePrint Arch., 2019)

Partially APN Boolean functions and classes of functions that are not APN infinitely often. - Lilya Budaghyan; Nikolay S. Kaleyski; Soonhak Kwon; Constanza Riera; Pantelimon Stanica (Cryptogr. Commun., 2020)

A refinement of Müller's cube root algorithm. - Gook Hwa Cho; Soonhak Kwon; Hyang-Sook Lee (Finite Fields Their Appl., 2020)

Investigations of c-Differential Uniformity of Permutations with Carlitz Rank 3. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (CoRR, 2022)

On non-monimial APcN permutations over finite fields of even characteristic. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (CoRR, 2022)

New differentially 4-uniform permutations from modifications of the inverse function. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (Finite Fields Their Appl., 2022)

Constructing differentially 4-uniform involutions over F22k by using Carlitz form. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (Finite Fields Their Appl., 2022)

On the boomerang uniformity of permutations of low Carlitz rank. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (Finite Fields Their Appl., 2022)

On Cryptographic Parameters of Permutation Polynomials of the form xrh(x(2n-1)/d). - Jaeseong Jeong; Chang Heon Kim; Namhun Koo; Soonhak Kwon; Sumin Lee (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

cc-differential uniformity, (almost) perfect cc-nonlinearity, and equivalences. - Nhan-Phu Chung; Jaeseong Jeong; Namhun Koo; Soonhak Kwon (CoRR, 2023)

On the Functions Which are CCZ-equivalent but not EA-equivalent to Quadratic Functions over Fpn. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (CoRR, 2023)

On non-monomial APcN permutations over finite fields of even characteristic. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (Finite Fields Their Appl., 2023)

Investigations of c-differential uniformity of permutations with Carlitz rank 3. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (Finite Fields Their Appl., 2023)

Low c-differential uniformity of the swapped inverse function in odd characteristic. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (Discret. Appl. Math., 2023)

The second-order zero differential uniformity of the swapped inverse functions over finite fields. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (CoRR, 2024)

On the computation of r-th roots in finite fields. - Gook Hwa Cho; Soonhak Kwon (Finite Fields Their Appl., 2024)

On the functions which are CCZ-equivalent but not EA-equivalent to quadratic functions over Fpn. - Jaeseong Jeong; Namhun Koo; Soonhak Kwon (Finite Fields Their Appl., 2025)

On Differential and Boomerang Properties of a Class of Binomials over Finite Fields of Odd Characteristic. - Namhun Koo; Soonhak Kwon (CoRR, 2025)