Soonhak Kwon

Gook Hwa Cho, Namhun Koo, Eunhye Ha, Soonhak Kwon: New Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field. IACR Cryptology ePrint Archive 2013: 24 (2013)

Gook Hwa Cho, Namhun Koo, Eunhye Ha, Soonhak Kwon: Trace Expression of r-th Root over Finite Field. IACR Cryptology ePrint Archive 2013: 41 (2013)

Namhun Koo, Gook Hwa Cho, Soonhak Kwon: Square Root Algorithm in F_q for q≡2^s+1 (mod 2^s+1). IACR Cryptology ePrint Archive 2013: 87 (2013)

Namhun Koo, Gook Hwa Cho, Soonhak Kwon: On r-th Root Extraction Algorithm in F_q For q≡lr^s+1 (mod r^s+1) with 0 < l < r and Small s. IACR Cryptology ePrint Archive 2013: 117 (2013)

Namhun Koo, Gooc Hwa Jo, Soonhak Kwon: On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve. IACR Cryptology ePrint Archive 2011: 292 (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): 1264-1280 (2010)

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong: More efficient systolic arrays for multiplication in GF(2^m) using LSB first algorithm with irreducible polynomials and trinomials. Computers & Electrical Engineering 35(1): 159-167 (2009)

Chang Shu, Soonhak Kwon, Kris Gaj: Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields. IEEE Trans. Computers 58(9): 1221-1237 (2009)

Soonhak Kwon, Taekyoung Kwon, Young-Ho Park: New Hardware Architecture for Multiplication over GF(2^m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography. IEICE Transactions 91-A(1): 236-243 (2008)

Taek-Young Youn, Young-Ho Park, Taekyoung Kwon, Soonhak Kwon, Jongin Lim: Efficient Flexible Batch Signing Techniques for Imbalanced Communication Applications. IEICE Transactions 91-D(5): 1481-1484 (2008)

Chang Shu, Soonhak Kwon, Kris Gaj: FPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials. IET Computers & Digital Techniques 2(1): 6-11 (2008)

Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong: FPGA implementation of high performance elliptic curve cryptographic processor over GF. Journal of Systems Architecture - Embedded Systems Design 54(10): 893-900 (2008)

Miaoqing Huang, Kris Gaj, Soonhak Kwon, Tarek A. El-Ghazawi: An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm. Public Key Cryptography 2008: 214-228

Miaoqing Huang, Kris Gaj, Soonhak Kwon, Tarek A. El-Ghazawi: An Optimized Hardware Architecture of Montgomery Multiplication Algorithm. IACR Cryptology ePrint Archive 2007: 228 (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 Cryptography 41(3): 299-306 (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: 119-133

Chang Shu, Soonhak Kwon, Kris Gaj: FPGA accelerated tate pairing based cryptosystems over binary fields. FPT 2006: 173-180

Chang Shu, Soonhak Kwon, Kris Gaj: FPGA Accelerated Tate Pairing Based Cryptosystems over Binary Fields. IACR Cryptology ePrint Archive 2006: 179 (2006)

Chang Hoon Kim, Chun Pyo Hong, Soonhak Kwon: A digit-serial multiplier for finite field GF(2/sup m/). IEEE Trans. VLSI Syst. 13(4): 476-483 (2005)

Soonhak Kwon: Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields. ACISP 2005: 134-145

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

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

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

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

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

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

Soonhak Kwon, Taekyoung Kwon, Young-Ho Park: Efficient Linear Array for Multiplication over NIST Recommended Binary Fields. WILF 2005: 427-436

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

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

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

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: 144-158

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

Soonhak Kwon: Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields. IACR Cryptology ePrint Archive 2004: 303 (2004)

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: 196-

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

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

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

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

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: 736-745

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

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

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

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

Ganghwa Lee, Yoonchul Lee, SukGyu Lee, Soonhak Kwon: Majority-Voting FCM Algorithm in the Vague Fuzzy Classification. FUZZ-IEEE 2001: 813-815