연구실적

• Duplication Free Public Keys Based on SIS-Type Problems, Hyang-Sook Lee, Juhee Lee, Seongan Lim, Finite Fields and Their Applications, Vol. 48, 2017, pp.430-446
• On Pairing Inversion of the Self-bilinear Map on Unknown Order Groups, Hyang-Sook Lee, Seongan Lim, and Ikkwon Yie, CSCML 2017, LNCS 10332, pp.86-95, 2017 
• Security analysis of a certificateless signature from lattices, Seunghwan Chang, Hyang-Sook Lee Juhee Lee and Seongan Lim, Security and Communication Networks, Vol. 2017, Jan. 2017 
• An Efficient Lattice Reduction Using Reuse Technique Blockwisely on NTRU, Hyang-Sook Lee, Kyungmi Chung, Seongan Lim, Discrete Applied Mathematics, Vol.214, Pages 88-98, September, 2016
• Message Expansion of the BGN Cryptosystem Using Product Pairing (with Sookyung Eom, Seongan Lim), ETRI, Vol.38, No.1 pp.123-132, Feb. 2016
• Families of Pairing-Friendly Elliptic Curves from a Polynomial Modification of the Dupont-Enge-Morain Method, (with Pa Ra Lee), Applied Mathematics and Information Sciences, 10, No.2, pp.571-580, 2016
• Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves, (with Hoon Hong, Eunjeong Lee), Finite Fields and Their Applications, Volume 34, 45–74, July 2015
• A Depth Specific Description of Somewhat Homomorphic Encryption and Its Applications, (with Seongan Lim) Appl. Math. Inf. Sci. 9, No. 3, 1-9, 2015
• Polynomial representations for n-th roots in finite fields, (with Seunghwan Chang, Bihtnara Kim), J. Korean Math. Soc. Vol. 52, No. 1, 209-224, 2015
• Quantum signature scheme for known quantum messages, (with Taewan Kim), Physica Scripta, Vol. 90, No. 5, 2015
• An Efficient Decoding of Goppa codes for the McEliece Cryptosystem, (with Meejin Choi, Seongan Lim), Fundamenta Informaticae Vol. 133, No. 4, 387-397, 2014
• Polynomial Generating Pairing and its Criterion for Optimal Pairnig, (with Eunjeong Lee, Cheolmin Park) Applicable Algebra in Engineering, Communication and Computing: Volume 25, Issue 4, Page 227-247, 2014
• Pairing Inversion via Non-degenerate Auxiliary Pairings (with Seunghwan Chang, Hoon Hong, Eunjeong Lee) Pairing-Based Cryptography – Pairing 2013, Lecture Notes in Computer Science Volume 8365, pp 77-96, 2014
• Faster Ate Pairing Computation over Pairing Friendly Elliptic Curves using GLV Decomposition, (with Soo-Kyung Eom, Eunjeong Lee), ETRI Journal, Vol.35, No.5, pp.880-888, 2013 
• Simple and Exact Formula for Minimum Loop Length in Atei pairing based on Brezing-Weng curves, (with Hoon Hong, Eunjeong Lee, Cheolmin Park), Design, Codes and Cryptography, Vol. 67, no. 2, pp.271-292, 2013 
• Maximum Gap in (Inverse) Cyclotomic Polynomial, (with Hoon Hong, Eunjeong Lee, Cheolmin Park), Journal of Number Theory, Vol.132, No.100, pp.2297-2315, 2012
• Constructing pairing-friendly curves with variable CM discriminant, (with Cheolmin Park), Bull. Korean Math. Soc. 49 (2012), No.1, pp.75-88
• Optimal Pairing Computation over Families of Pairing-friendly Elliptic Curve, (with Soo-Kyung Eom and Cheol- Min Park), Applicable Algebra in Engineering, Communication and Computing, vol.22, no.4, pp.235-248, Nov. 2011
• An Efficient Incomparable Public Key Encryption Scheme, (with Seongan Lim), Information Sciences, vol.181, pp.3066-3072, 2011
• Pairing-Friendly Curves with Minimal Security Loss by Cheon's Algorithm, (with Cheol-Min Park), ETRI Journal, vol. 33, no. 4, pp.656-659, 2011
• A Short and Efficient Redactable Signature based on RSA, (with Seongan Lim), ETRI Journal, vol.33, no.4, pp.621- 628, 2011
• Generating pairing-friendly curves with the CM equation of degree 1, (with Cheol-Min Park), Pairing 2009, Lecture Notes in Computer Science, vol. 5671, page 66-77, 2009
• Efficient and Generalized Pairing Computation on Abelian Varieties, (with Eunjeong Lee and Cheol-Min Park), IEEE Transactions on Information Theory, Vol.55, No.4, pp.1793-1803, 2009
• Analysis of the Strong Instance for the Vector Decomposition Problem, (with Seran Kwon), Bulletin of KMS, Vol. 46, No.2, 2009
• Eta pairing computation on general divisors over hyperelliptic curves y 2 = x p -x ±1 (with Eunjeong Lee and Yoonjin Lee), Journal of Symbolic Computation, Vol. 43, no. 6-7, pp 452-474, 2008
• Eta pairing computation on general divisors over hyperelliptic curves y 2 = x 7 -x ±1 (with Eunjeong Lee and Yoonjin Lee), Pairing 2007, Lecture Notes in Computer Science, Vol. 4575, pp.349-366, 2007
• A group key agreement protocol from pairings(with Iwan Duursma), Applied Mathematics and Computation, Vol. 167, No. 2, pp 1451-1456, 2005
• Homotopy fixed point sets and actions on homogeneous spaces of p-compact groups (with Kenshi Ishiguro), Journal of KMS, Vol. 41, no. 6, pp. 1101-1114, 2004
• Multi-Party Authenticated Key Agreement Protocols from Multilinear Forms (with Young- Ran Lee, Ho-Kyu Lee), Applied Mathematics and Computation, Vol. 159, no. 2, pp.317-331, 2004
• A self pairing map and its applications to cryptography, Applied Mathematics and Computation, Vol. 151, no. 3, pp.671-678, 2004
• Tate-pairing implementations for hyperelliptic curves y^2=x^p+x+1 (with Iwan Duursma), Advances in Cryptology-Asiacrypt 2003, Springer-Verlag, Vol. 2894, Lecture Notes in Computer Science, pp.111-123, 2003
• The better bound of private key in RSA with unbalanced primes, (with Hyun-Soo Hong, Ho-Kyu Lee, Hee-Jung Lee), Applied Mathematics and Computation, Vol. 139, no. 2-3, pp. 351-362, 2003
• Stable splittings of classifying spaces of 2-toral compact Lie groups, Topology and its Applications, vol. 125, no.1, pp.73-85, 2002
• Finite generations of equivariant cohomology for p-compact group G, Bulletin of the Australian Mathematical Society, 58, no.3, 1998
• Induced maps in Fp-homology for compact Lie group, Topology and its Applications, vol. 87, No.3, 1998
• The stable and unstable types of classifying spaces, Canadian Mathematical Bulletins, vol. 40, No.3, 1997
• Invariant theory over the tensor product of polynomial algebra and exterior algebra, Communications in Algebras, vol.23, 1995

• Minimal condition for shortest vectors in lattices of low dimension (Table-1_2, Example-7, Example-13, Example-17)

 * Maple codes are provided above that can be used to verify examples contained in the paper "Minimal condition for shortest vectors in lattices of low dimension." Please let me know if you have any questions or comments. (Email at hsl@ewh.ac.kr)

• "Sage codes for a key substitution attack on GPS signature" - Section 3.2.2 (Our_example)