Soonhak Kwon

	2011
39		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)
	2010
38		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)
	2009
37		Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong: More efficient systolic arrays for multiplication in GF(2m) using LSB first algorithm with irreducible polynomials and trinomials. Computers & Electrical Engineering 35(1): 159-167 (2009)
36		Chang Shu, Soonhak Kwon, Kris Gaj: Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields. IEEE Trans. Computers 58(9): 1221-1237 (2009)
	2008
35		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
34		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)
33		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)
32		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)
31		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)
	2007
30		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)
	2006
29		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
28		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)
27		Chang Shu, Soonhak Kwon, Kris Gaj: FPGA Accelerated Tate Pairing Based Cryptosystems over Binary Fields. IACR Cryptology ePrint Archive 2006: 179 (2006)
	2005
26		Soonhak Kwon: Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields. ACISP 2005: 134-145
25		Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong: A fast digit-serial systolic multiplier for finite field GF(2m). ASP-DAC 2005: 1268-1271
24		Chang Hoon Kim, Chun Pyo Hong, Soonhak Kwon: A Novel Arithmetic Unit over GF(2m) for Low Cost Cryptographic Applications. HPCC 2005: 524-534
23		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
22		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
21		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
20		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
19		Soonhak Kwon, Taekyoung Kwon, Young-Ho Park: Efficient Linear Array for Multiplication over NIST Recommended Binary Fields. WILF 2005: 427-436
18		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
17		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
16		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
15		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
14		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
13		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
12		Soonhak Kwon: Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields. IACR Cryptology ePrint Archive 2004: 303 (2004)
	2003
11		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		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		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		Soonhak Kwon, Heuisu Ryu: Efficient Bit Serial Multiplication in GF(2m) for a Class of Finite Fields. ICOIN 2003: 762-771
7		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		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		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		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		Soonhak Kwon: Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields. ICICS 2002: 209-216
2		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

Coauthor Index

1	Ramakrishna Bachimanchi	[29] [38]
2	Patrick Baier	[29] [38]
3	Tarek A. El-Ghazawi	[30] [35]
4	Kris Gaj	[17] [27] [29] [30] [32] [35] [36] [38]
5	Chun Pyo Hong	[4] [5] [6] [9] [10] [11] [14] [15] [16] [17] [18] [20] [22] [23] [24] [25] [28] [31] [37]
6	Miaoqing Huang	[30] [35]
7	Gooc Hwa Jo	[39]
8	Mohammed Khaleeluddin	[29] [38]
9	Chang Kim	[20]
10	Chang Hoon Kim	[4] [5] [6] [9] [10] [11] [14] [15] [16] [17] [18] [22] [23] [24] [25] [28] [31] [37]
11	Hiecheol Kim	[16]
12	Jong Jin Kim	[9] [10]
13	Paul Kohlbrenner	[29] [38]
14	Namhun Koo	[39]
15	Taekyoung Kwon (Ted Taekyoung Kwon)	[19] [21] [33] [34]
16	Hoang Le	[29] [38]
17	Ganghwa Lee	[1]
18	SukGyu Lee	[1]
19	Yoonchul Lee	[1]
20	Jongin Lim (Jong In Lim)	[33]
21	In-Gil Nam	[5] [23]
22	Young-Ho Park	[19] [21] [33] [34]
23	Marcin Rogawski	[38]
24	Heuisu Ryu	[2] [8]
25	Chang Shu	[27] [32] [36]
26	Taek-Young Youn	[33]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page