| 2012 | ||
|---|---|---|
| j3 | Young In Cho, Nam Su Chang, Chang Han Kim, Young-Ho Park, Seokhie Hong: New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over GF(2n). IEEE Trans. VLSI Syst. 20(10): 1903-1908 (2012) | |
| 2011 | ||
| c5 | Chang Han Kim, Nam Su Chang, Young In Cho: Modified Sequential Multipliers for Type-k Gaussian Normal Bases. MUE 2011: 220-225 | |
| 2010 | ||
| j2 | Nam Su Chang, Tae Hyun Kim, Chang Han Kim, Dong-Guk Han, Jongin Lim: A new bit-serial multiplier over GF(pm) using irreducible trinomials. Computers & Mathematics with Applications 60(2): 355-361 (2010) | |
| 2009 | ||
| j1 | Daesung Lim, Nam Su Chang, Sung Yeon Ji, Chang Han Kim, Sangjin Lee, Young-Ho Park: An efficient signed digit montgomery multiplication for RSA. Journal of Systems Architecture - Embedded Systems Design 55(7-9): 355-362 (2009) | |
| 2005 | ||
| c4 | Sosun Kim, Nam Su Chang, Chang Han Kim, Young-Ho Park, Jongin Lim: A Fast Inversion Algorithm and Low-Complexity Architecture over GF(2m). CIS (2) 2005: 1-8 | |
| c3 | Chang Han Kim, Yongtae Kim, Nam Su Chang, IlWhan Park: Modified Serial Multipliers for Type-IV Gaussian Normal Bases. INDOCRYPT 2005: 375-388 | |
| c2 | Nam Su Chang, Chang Han Kim, Young-Ho Park, Jongin Lim: A Non-redundant and Efficient Architecture for Karatsuba-Ofman Algorithm. ISC 2005: 288-299 | |
| 2003 | ||
| c1 | Dong-Guk Han, Nam Su Chang, Seok Won Jung, Young-Ho Park, Chang Han Kim, Heuisu Ryu: Cryptanalysis of the Full Version Randomized Addition-Subtraction Chains. ACISP 2003: 67-78 | |
Data released under the ODC-BY 1.0 license — See also our legal information page