|
Journal
|
2020 |
Efficient Bit-Parallel Multiplier for All Trinomials Based on n-Term Karatsuba Algorithm
박선미 IEEE Access, v.8, pp.173491-173507 |
4 |
원문
|
|
Journal
|
2020 |
Space Efficient $GF(2^m)$ Multiplier for Special Pentanomials Based on $n$ -Term Karatsuba Algorithm
박선미 IEEE Access, v.8, pp.27342-27360 |
4 |
원문
|
|
Journal
|
2019 |
Low Space Complexity GF (2m) Multiplier for Trinomials Using n-Term Karatsuba Algorithm
박선미 IEEE Access, v.7, pp.27047-27064 |
6 |
원문
|
|
Journal
|
2013 |
Fast Bit-Parallel Polynomial Basis Multiplier for GF(2m) Defined by Pentanomials Using Weakly Dual Basis
박선미 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E96.A, no.1, pp.322-331 |
1 |
원문
|
|
Journal
|
2011 |
Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF 2m
박선미 IEEE Transactions on Very Large Scale Integration (VLSI) Systems, v.19, no.12, pp.2317-2321 |
8 |
원문
|
|
Journal
|
2006 |
Low Complexity Bit-Parallel Squarer for GF(2n) Defined by Irreducible Trinomials
박선미 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E89-A, no.9, pp.2451-2452 |
8 |
원문
|
|
Journal
|
2006 |
Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis
박선미 IEEE Transactions on Computers, v.55, no.9, pp.1211-1215 |
17 |
원문
|
|
Journal
|
2005 |
Low Complexity Bit-Parallel Multiplier for GF(2^m) Defined by All-One Polynomials Using Redundant Representation
Ku Young Chang IEEE Transactions on Computers, v.54, no.12, pp.1628-1630 |
21 |
원문
|
|
Conference
|
2004 |
Low complexity bit-parallel multiplier for GF(2 m) defined by pentanomials
Ku Young Chang 한국정보처리학회 학술 발표 대회 (추계) 2004, pp.1295-1298 |
|
|