Cryptanalysis of the Full Version Randomized Addition-Subtraction Chains. - Dong-Guk Han; Nam Su Chang; Seok Won Jung; Young-Ho Park 001; Chang Han Kim; Heuisu Ryu (ACISP, 2003)

A Fast Inversion Algorithm and Low-Complexity Architecture over GF(2m). - Sosun Kim; Nam Su Chang; Chang Han Kim; Young-Ho Park 001; Jongin Lim 001 (CIS (2), 2005)

Modified Serial Multipliers for Type-IV Gaussian Normal Bases. - Chang Han Kim; Yongtae Kim; Nam Su Chang; IlHwan Park (INDOCRYPT, 2005)

A Non-redundant and Efficient Architecture for Karatsuba-Ofman Algorithm. - Nam Su Chang; Chang Han Kim; Young-Ho Park 001; Jongin Lim 001 (ISC, 2005)

An efficient signed digit montgomery multiplication for RSA. - Daesung Lim; Nam Su Chang; Sung Yeon Ji; Chang Han Kim; Sangjin Lee 002; Young-Ho Park 001 (J. Syst. Archit., 2009)

A new bit-serial multiplier over GF(pm) using irreducible trinomials. - Nam Su Chang; Tae Hyun Kim 003; Chang Han Kim; Dong-Guk Han; Jongin Lim 001 (Comput. Math. Appl., 2010)

Modified Sequential Multipliers for Type-k Gaussian Normal Bases. - Chang Han Kim; Nam Su Chang; Young In Cho (MUE, 2011)

New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over GF(2n). - Young In Cho; Nam Su Chang; Chang Han Kim; Young-Ho Park 001; Seokhie Hong (IEEE Trans. Very Large Scale Integr. Syst., 2012)

Formulas for cube roots in F3m using shifted polynomial basis. - Young In Cho; Nam Su Chang; Seokhie Hong (Inf. Process. Lett., 2014)

Low complexity bit-parallel multiplier for F2n defined by repeated polynomials. - Nam Su Chang; Eun Sook Kang; Seokhie Hong (Discret. Appl. Math., 2018)

Efficient implementation of modular multiplication over 192-bit NIST prime for 8-bit AVR-based sensor node. - Dong-won Park; Seokhie Hong; Nam Su Chang; Sung Min Cho (J. Supercomput., 2021)