New Public Key Cryptosystem Using Finite Non Abelian Groups. - Seong-Hun Paeng; Kil-Chan Ha; Jae Heon Kim; Seongtaek Chee; Choonsik Park (CRYPTO, 2001)

Improved Public Key Cryptosystem using Finite non Abelian Groups. - Seong-Hun Paeng; Daesung Kwon; Kil-Chan Ha; Jae Heon Kim (IACR Cryptol. ePrint Arch., 2001)

A Lattice Based Public Key Cryptosystem Using Polynomial Representations. - Seong-Hun Paeng; Bae Eun Jung; Kil-Chan Ha (Public Key Cryptography, 2003)

On the security of cryptosystem using automorphism groups. - Seong-Hun Paeng (Inf. Process. Lett., 2003)

Attacks to Xu-Tilborg's conference key distribution scheme. - Bae Eun Jung; Seong-Hun Paeng; DaeYoub Kim (IEEE Commun. Lett., 2004)

Representations of finite fields and the Naini-Seberry partitioning problem. - Bae Eun Jung; Seong-Hun Paeng (IEEE Commun. Lett., 2005)

Approximately n-secting an angle. - Seok Woo Kim; Seong-Hun Paeng; Hee Je Cho (Inf. Process. Lett., 2007)

A note on partition sum polynomials. - Seong-Hun Paeng; Hee Je Cho (Eur. J. Comb., 2008)

Volume and diameter of a graph and Ollivier's Ricci curvature. - Seong-Hun Paeng (Eur. J. Comb., 2012)

Ollivier's Ricci curvature and the coloring of graphs. - Hee Je Cho; Seong-Hun Paeng (Eur. J. Comb., 2013)

On the mean square displacement of a random walk on a graph. - Seonghyuk Im; Hwidong Kim; Jiho Maeng; Jihwan Yu; Yongwook Cha; Seong-Hun Paeng (Eur. J. Comb., 2016)

Classification of α-Ricci flat graphs with girth at least five. - Hee Je Cho; Seong-Hun Paeng (Discret. Math., 2018)