2008 |
22 | EE | Hyun Min Choi,
Chun Pyo Hong,
Chang Hoon Kim:
High Performance Elliptic Curve Cryptographic Processor Over GF(2^163).
DELTA 2008: 290-295 |
21 | EE | Tae Ho Kim,
Sang Chul Kim,
Chang Hoon Kim,
Chun Pyo Hong:
Scalable Montgomery Multiplier for Finite Fields GF(p) and GF(2^m).
DELTA 2008: 458-461 |
20 | 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 |
19 | | Nam Gon Lee,
Tae Ho Kim,
Chang Hoon Kim,
Chun Pyo Hong:
A Frequency Domain GSC Algorithm Based on Wavelet Filter.
IPCV 2006: 202-208 |
18 | | Tae Ho Kim,
Jong Jin Kim,
Chang Hoon Kim,
Chun Pyo Hong:
Flexible Cryptographic Component Design for Secure Web Applications.
Security and Management 2006: 186-192 |
17 | 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 |
16 | 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 |
15 | 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 |
14 | 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 |
13 | 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 |
12 | 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 |
11 | 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 |
10 | 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 |
9 | 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 |
8 | 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 |
2003 |
7 | 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 |
6 | 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 |
5 | 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 |
4 | 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 |
3 | 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 |
2 | 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 |
1 | | Won-Ho Lee,
Kee-Won Kim,
Nam-Yeun Kim,
Kee-Young Yoo,
Chang Hoon Kim,
Chun Pyo Hong:
Architecture for AB2 Operation over GF(2m) using Irreducible AOP and Its Applications.
Computers and Their Applications 2002: 446-449 |