Sun-Mi Park
Orcid: 0000-0002-3003-6288
According to our database1,
Sun-Mi Park
authored at least 30 papers
between 2003 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2020
Efficient Bit-Parallel Multiplier for All Trinomials Based on n-Term Karatsuba Algorithm.
IEEE Access, 2020
Space Efficient $GF(2^m)$ Multiplier for Special Pentanomials Based on $n$ -Term Karatsuba Algorithm.
IEEE Access, 2020
2019
Low Space Complexity $GF(2^m)$ Multiplier for Trinomials Using $n$ -Term Karatsuba Algorithm.
IEEE Access, 2019
2018
Subquadratic Space Complexity Multiplier Using Even Type GNB Based on Efficient Toeplitz Matrix-Vector Product.
IEEE Trans. Computers, 2018
Inf. Process. Lett., 2018
Efficient Three-Way Split Formulas for Binary Polynomial Multiplication and Toeplitz Matrix Vector Product.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
2017
New Block Recombination for Subquadratic Space Complexity Polynomial Multiplication Based on Overlap-Free Approach.
IEEE Trans. Computers, 2017
2016
IEEE Trans. Computers, 2016
Explicit formulae for Mastrovito matrix and its corresponding Toeplitz matrix for all irreducible pentanomials using shifted polynomial basis.
Integr., 2016
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016
2015
Low Complexity Multiplier Based on Dickson Basis Using Efficient Toeplitz Matrix-Vector Product.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
Generalization to Any Field of Toeplitz Matrix Vector Product Based on Multi-Way Splitting Method and Its Application.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
2014
IEEE Trans. Computers, 2014
Integr., 2014
Bit-Parallel Cubing Computation over <i>GF</i>(3<i><sup>m</sup></i>) for Irreducible Trinomials.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
2013
Inf. Process. Lett., 2013
Fast Bit-Parallel Polynomial Basis Multiplier for <i>GF</i>(2<sup><i>m</i></sup>) Defined by Pentanomials Using Weakly Dual Basis.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
2012
Explicit formulae of polynomial basis squarer for pentanomials using weakly dual basis.
Integr., 2012
2011
Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF(2<sup>m</sup>).
IEEE Trans. Very Large Scale Integr. Syst., 2011
Proceedings of the Convergence and Hybrid Information Technology, 2011
2010
J. Inf. Process. Syst., 2010
2008
Proceedings of the 2008 IEEE/IPIP International Conference on Embedded and Ubiquitous Computing (EUC 2008), 2008
Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, 2008
Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, 2008
2007
A Texture-Based Algorithm for Vehicle Area Segmentation Using the Support Vector Machine Method.
Proceedings of the Rough Sets, 2007
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques, 2007
2006
Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis.
IEEE Trans. Computers, 2006
Low Complexity Bit-Parallel Squarer for <i>GF</i>(2<sup><i>n</i></sup>) Defined by Irreducible Trinomials.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
2003
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics.
Proceedings of the International Conference on Communications in Computing, 2003