2008 |
31 | EE | 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 |
30 | EE | Soonhak Kwon,
Taekyoung Kwon,
Young-Ho Park:
New Hardware Architecture for Multiplication over GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography.
IEICE Transactions 91-A(1): 236-243 (2008) |
29 | EE | 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) |
28 | EE | 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) |
2006 |
27 | EE | 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 |
26 | EE | 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) |
2005 |
25 | EE | Soonhak Kwon:
Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields.
ACISP 2005: 134-145 |
24 | EE | Chang Hoon Kim,
Soonhak Kwon,
Chun Pyo Hong:
A fast digit-serial systolic multiplier for finite field GF(2m).
ASP-DAC 2005: 1268-1271 |
23 | EE | Chang Hoon Kim,
Chun Pyo Hong,
Soonhak Kwon:
A Novel Arithmetic Unit over GF(2m) for Low Cost Cryptographic Applications.
HPCC 2005: 524-534 |
22 | EE | Chang Hoon Kim,
Soonhak Kwon,
Chun Pyo Hong,
In-Gil Nam:
A New Digit-Serial Systolic Mulitplier for High Performance GF(2m) Applications.
HPCC 2005: 560-566 |
21 | EE | Soonhak Kwon,
Chang Hoon Kim,
Chun Pyo Hong:
Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2m) for High Speed Cryptographic Processors.
ICCSA (1) 2005: 508-518 |
20 | EE | Soonhak Kwon,
Taekyoung Kwon,
Young-Ho Park:
New Architecture for Multiplication in GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography.
ICISC 2005: 335-351 |
19 | EE | Soonhak Kwon,
Chang Kim,
Chun Pyo Hong:
Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2m) Using LSB First Algorithm.
WILF 2005: 420-426 |
18 | EE | Soonhak Kwon,
Taekyoung Kwon,
Young-Ho Park:
Efficient Linear Array for Multiplication over NIST Recommended Binary Fields.
WILF 2005: 427-436 |
17 | EE | 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) |
2004 |
16 | EE | Soonhak Kwon,
Kris Gaj,
Chang Hoon Kim,
Chun Pyo Hong:
Efficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography.
CHES 2004: 76-91 |
15 | EE | Chang Hoon Kim,
Soonhak Kwon,
Chun Pyo Hong,
Hiecheol Kim:
A New Systolic Array for Least Significant Digit First Multiplication in GF(2m).
ICCSA (3) 2004: 656-666 |
14 | EE | Soonhak Kwon,
Chang Hoon Kim,
Chun Pyo Hong:
A Linear Systolic Array for Multiplication in GF(2m) for High Speed Cryptographic Processors.
ICCSA (4) 2004: 106-116 |
13 | EE | 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 |
12 | EE | Soonhak Kwon:
Signed Digit Representation with NAF and Balanced Ternary Form and Efficient Exponentiation in GF(qn) Using a Gaussian Normal Basis of Type II.
WISA 2004: 332-344 |
2003 |
11 | EE | Soonhak Kwon,
Chang Hoon Kim,
Chun Pyo Hong:
Efficient Exponentiation for a Class of Finite Fields GF(2 n) Determined by Gauss Periods.
CHES 2003: 228-242 |
10 | EE | Chang Hoon Kim,
Soonhak Kwon,
Jong Jin Kim,
Chun Pyo Hong:
A New Arithmetic Unit in GF(2m) for Reconfigurable Hardware Implementation.
FPL 2003: 670-680 |
9 | EE | 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 |
8 | EE | Soonhak Kwon,
Heuisu Ryu:
Efficient Bit Serial Multiplication in GF(2m) for a Class of Finite Fields.
ICOIN 2003: 762-771 |
7 | EE | 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- |
6 | EE | 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 |
5 | EE | 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 |
4 | EE | 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 |
2002 |
3 | EE | Soonhak Kwon:
Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields.
ICICS 2002: 209-216 |
2 | EE | Soonhak Kwon,
Heuisu Ryu:
Efficient Bit Serial Multiplication Using Optimal Normal Bases of Type II in GF (2m).
ISC 2002: 300-308 |
2001 |
1 | | Ganghwa Lee,
Yoonchul Lee,
SukGyu Lee,
Soonhak Kwon:
Majority-Voting FCM Algorithm in the Vague Fuzzy Classification.
FUZZ-IEEE 2001: 813-815 |