Soonhak Kwon

发表

On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve

Namhun Koo, Gooc Hwa Jo, Soonhak Kwon, 2016, IACR Cryptol. ePrint Arch..

A Compact and Fast Division Architecture for a Finite Field

Soonhak Kwon, Chang Hoon Kim, Jong Jin Kim, 2003, ICCSA.

Efficient Bit Serial Multiplication Using Optimal Normal Bases of Type II in GF (2m)

Soonhak Kwon, Heuisu Ryu, 2002, ISC.

Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware

Patrick Baier, Kris Gaj, Soonhak Kwon, 2006, CHES.

A Linear Systolic Array for Multiplication in GF(2m) for High Speed Cryptographic Processors

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2004, ICCSA.

FPGA implementation of high performance elliptic curve cryptographic processor over GF

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2008, J. Syst. Archit..

Efficient Linear Array for Multiplication over NIST Recommended Binary Fields

Taekyoung Kwon, Young-Ho Park, Soonhak Kwon, 2005, WILF.

On $r$ -th Root Extraction Algorithm in $\mathbb {F}_q$ for $q\equiv lr^{s}+1\;({\mathrm mod}\; r^{s+1})$ with $0 and Small $s$

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2016 .

More efficient systolic arrays for multiplication in GF(2m) using LSB first algorithm with irreducible polynomials and trinomials

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2009, Comput. Electr. Eng..

Novel Arithmetic Unit in GF(2m) for Reconfigurable Hardware

Soonhak Kwon, Chang Hoon Kim, Jong Jin Kim, 2003 .

Efficiency enhancement for power amplifiers using dynamic bias switching technique

Youngoo Yang, Kyung-hoon Lim, Hyun-Chul Park, 2008 .

On r-th Root Extraction Algorithm in for with and Small

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2016 .

Efficient Bit-Serial Multipliers for a Class of Finite Fields

Soonhak Kwon, Heuisu Ryu, 2002 .

An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm

Tarek A. El-Ghazawi, Miaoqing Huang, Kris Gaj, 2008, Public Key Cryptography.

Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields

Soonhak Kwon, Soonhak Kwon, 2002, ICICS.

A Novel Arithmetic Unit over GF(2m) for Low Cost Cryptographic Applications

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2005, HPCC.

A New Arithmetic Unit in GF(2m) for Reconfigurable Hardware Implementation

Soonhak Kwon, Chang Hoon Kim, Jong Jin Kim, 2003, FPL.

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2006, Des. Codes Cryptogr..

Efficient bit-serial systolic array for division over GF(2/sup m/) [elliptic curve cryptosystem applications]

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

New Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2013, IACR Cryptol. ePrint Arch..

FPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials

Kris Gaj, Chang Shu, Soonhak Kwon, 2008, IET Comput. Digit. Tech..

On the Cipolla–Lehmer type algorithms in finite fields

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2018, Applicable Algebra in Engineering, Communication and Computing.

Square Root Algorithm in Fq for q≡2s+1 (mod 2s+1)

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2013, IACR Cryptol. ePrint Arch..

Efficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography

Kris Gaj, Soonhak Kwon, Chang Hoon Kim, 2004, CHES.

Partially APN Boolean functions and classes of functions that are not APN infinitely often

Soonhak Kwon, Constanza Riera, Lilya Budaghyan, 2019, Cryptography and Communications.

A New Digit-Serial Systolic Mulitplier for High Performance GF(2m) Applications

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2005, HPCC.

Signed Digit Representation with NAF and Balanced Ternary Form and Efficient Exponentiation in GF(qn) Using a Gaussian Normal Basis of Type II

Soonhak Kwon, Soonhak Kwon, 2004, WISA.

On the Boomerang Uniformity of Permutations of Low Carlitz Rank pdf

Namhun Koo, Soonhak Kwon, Jaeseong Jeong, 2020, Finite Fields Their Appl..

A systolic multiplier with LSB first algorithm over GF(2/sup m/) which is as efficient as the one with MSB first algorithm

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

New Hardware Architecture for Multiplication over GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography

Taekyoung Kwon, Young-Ho Park, Soonhak Kwon, 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2m) Using LSB First Algorithm

Soonhak Kwon, Chun Pyo Hong, Chang Kim, 2005, WILF.

Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields

Kris Gaj, Chang Shu, Soonhak Kwon, 2009, IEEE Transactions on Computers.

On r-th Root Extraction Algorithm in Fq For q≡lrs+1 (mod rs+1) with 0 < l < r and Small s

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2013, IACR Cryptol. ePrint Arch..

Efficient Flexible Batch Signing Techniques for Imbalanced Communication Applications

Jongin Lim, Taekyoung Kwon, Young-Ho Park, 2008, IEICE Trans. Inf. Syst..

A New Systolic Array for Least Significant Digit First Multiplication in GF(2m)

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2004, ICCSA.

Efficient Exponentiation for a Class of Finite Fields GF(2 n) Determined by Gauss Periods

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2003, CHES.

A digit-serial multiplier for finite field GF(2/sup m/)

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2005, IEEE Trans. Very Large Scale Integr. Syst..

Trace Expression of r-th Root over Finite Field

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2013, IACR Cryptol. ePrint Arch..

Remarks on the Pocklington and Padró-Sáez Cube Root Algorithm in 𝔽q

Kwang Ho Lee, Namhun Koo, Soonhak Kwon, 2014, IACR Cryptol. ePrint Arch..

On r-th Root Extraction Algorithm in 𝔽q for q≍lrs+1;(mod; rs+1) with 0

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2016, IEEE Trans. Computers.

On cryptographic parameters of permutation polynomials of the form xrh(x(q-1)/d)

Namhun Koo, Soonhak Kwon, Jaeseong Jeong, 2019, IACR Cryptol. ePrint Arch..

Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields

Soonhak Kwon, 2004, IACR Cryptol. ePrint Arch..

An Improvement of the Cipolla-Lehmer Type Algorithms pdf

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2015, ArXiv.

Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2m) for High Speed Cryptographic Processors

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2005, ICCSA.

Information Security and Cryptology - ICISC 2015

Soonhak Kwon, Soonhak Kwon • Aaram Yun, Soonhak Kwon, 2015, Lecture Notes in Computer Science.

Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields

Soonhak Kwon, Soonhak Kwon, 2005, ACISP.

Efficient Bit Serial Multiplication in GF(2m) for a Class of Finite Fields

Soonhak Kwon, Heuisu Ryu, Soonhak Kwon, 2003, ICOIN.

Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2003, ISAAC.

FPGA accelerated tate pairing based cryptosystems over binary fields

Kris Gaj, Chang Shu, Soonhak Kwon, 2006, 2006 IEEE International Conference on Field Programmable Technology.

Majority-voting FCM algorithm in the vague fuzzy classification

Soonhak Kwon, Yoonchul Lee, Ganghwa Lee, 2001, 10th IEEE International Conference on Fuzzy Systems. (Cat. No.01CH37297).

A refinement of Müller's cube root algorithm

Soonhak Kwon, Gook Hwa Cho, Hyang-Sook Lee, 2020, Finite Fields Their Appl..

Fast Irreducibility Testing for XTR Using a Gaussian Normal Basis of Low Complexity

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2004, Selected Areas in Cryptography.

EFFICIENT BIT SERIAL MULTIPLIERS OF BERLEKAMP TYPE IN IF₂ m

Soonhak Kwon, 2002 .

New cube root algorithm based on the third order linear recurrence relations in finite fields

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2015, Des. Codes Cryptogr..

Area-Time Efficient Implementation of the Elliptic Curve Method of Factoring in Reconfigurable Hardware for Application in the Number Field Sieve

Patrick Baier, Kris Gaj, Soonhak Kwon, 2010, IEEE Transactions on Computers.

A fast digit-serial systolic multiplier for finite field GF(2/sup m/)

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

An NTRU-based Key Agreement Scheme for Wireless Sensor Networks

Namhun Koo, Soonhak Kwon, Gook-Hwa Jo, 2010 .

New Architecture for Multiplication in GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography

Taekyoung Kwon, Young-Ho Park, Soonhak Kwon, 2005, ICISC.

A low complexity and a low latency bit parallel systolic multiplier over GF(2/sup m/) using an optimal normal basis of type II

Soonhak Kwon, Soonhak Kwon, 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

Constructing differentially 4-uniform involutions over F22k by using Carlitz form

Namhun Koo, Soonhak Kwon, Jaeseong Jeong, 2022, Finite Fields Their Appl..

New differentially 4-uniform permutations from modifications of the inverse function

Namhun Koo, Soonhak Kwon, Jaeseong Jeong, 2022, Finite Fields Their Appl..

The number of representations of integers by 4-dimensional strongly N-modular lattices

Soonhak Kwon, Ho Yun Jung, Kyoungmin Kim, 2021, The Ramanujan Journal.

A fast digit-serial systolic multiplier for finite field GF(2m)

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2005, ASP-DAC '05.

Square root algorithm in q for q ≡ 2 s + 1 (mod 2 s+1)

Namhun Koo, Soonhak Kwon, Gook Hwa Cho, 2013 .

A Digit-Serial Multiplier for Finite Field

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, 2005 .