default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoonhak Kwon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Gook Hwa Cho, Soonhak Kwon:
On the computation of r-th roots in finite fields. Finite Fields Their Appl. 99: 102479 (2024)- [i19]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
The second-order zero differential uniformity of the swapped inverse functions over finite fields. CoRR abs/2405.16784 (2024) - 2023
- [j21]Jaeseong Jeong, Namhun Koo
, Soonhak Kwon:
Low c-differential uniformity of the swapped inverse function in odd characteristic. Discret. Appl. Math. 336: 195-209 (2023) - [j20]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
Investigations of c-differential uniformity of permutations with Carlitz rank 3. Finite Fields Their Appl. 86: 102145 (2023) - [j19]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
On non-monomial APcN permutations over finite fields of even characteristic. Finite Fields Their Appl. 89: 102196 (2023) - [i18]Nhan-Phu Chung, Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
cc-differential uniformity, (almost) perfect cc-nonlinearity, and equivalences. CoRR abs/2301.09325 (2023) - [i17]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
On the Functions Which are CCZ-equivalent but not EA-equivalent to Quadratic Functions over Fpn. CoRR abs/2306.13718 (2023) - 2022
- [j18]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
New differentially 4-uniform permutations from modifications of the inverse function. Finite Fields Their Appl. 77: 101931 (2022) - [j17]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
Constructing differentially 4-uniform involutions over F22k by using Carlitz form. Finite Fields Their Appl. 78: 101957 (2022) - [j16]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
On the boomerang uniformity of permutations of low Carlitz rank. Finite Fields Their Appl. 81: 102033 (2022) - [j15]Jaeseong Jeong, Chang Heon Kim, Namhun Koo, Soonhak Kwon, Sumin Lee:
On Cryptographic Parameters of Permutation Polynomials of the form xrh(x(2n-1)/d). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(8): 1134-1146 (2022) - [i16]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
Investigations of c-Differential Uniformity of Permutations with Carlitz Rank 3. CoRR abs/2202.02185 (2022) - [i15]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
Low c-Differential Uniformity of the Swapped Inverse Function in Odd Characteristic. CoRR abs/2203.06926 (2022) - [i14]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
On non-monimial APcN permutations over finite fields of even characteristic. CoRR abs/2205.11418 (2022) - 2020
- [j14]Lilya Budaghyan, Nikolay S. Kaleyski, Soonhak Kwon, Constanza Riera, Pantelimon Stanica:
Partially APN Boolean functions and classes of functions that are not APN infinitely often. Cryptogr. Commun. 12(3): 527-545 (2020) - [j13]Gook Hwa Cho, Soonhak Kwon, Hyang-Sook Lee:
A refinement of Müller's cube root algorithm. Finite Fields Their Appl. 67: 101708 (2020) - [i13]Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
On the Boomerang Uniformity of Permutations of Low Carlitz Rank. CoRR abs/2009.08612 (2020)
2010 – 2019
- 2019
- [j12]Gook Hwa Cho, Byeonghwan Go, Chang Heon Kim, Namhun Koo, Soonhak Kwon:
On the Cipolla-Lehmer type algorithms in finite fields. Appl. Algebra Eng. Commun. Comput. 30(2): 135-145 (2019) - [i12]Lilya Budaghyan, Nikolay S. Kaleyski, Soonhak Kwon, Constanza Riera, Pantelimon Stanica:
Partially APN Boolean functions and classes of functions that are not APN infinitely often. CoRR abs/1905.13025 (2019) - [i11]Jaeseong Jeong, Chang Heon Kim, Namhun Koo, Soonhak Kwon, Sumin Lee:
On cryptographic parameters of permutation polynomials of the form xrh(x(q-1)/d). IACR Cryptol. ePrint Arch. 2019: 767 (2019) - 2016
- [j11]Namhun Koo, Gook Hwa Cho, Soonhak Kwon:
On r-th Root Extraction Algorithm in 𝔽q for q≍lrs+1;(mod; rs+1) with 0<l<r and Small s. IEEE Trans. Computers 65(1): 322-325 (2016) - [e1]Soonhak Kwon, Aaram Yun:
Information Security and Cryptology - ICISC 2015 - 18th International Conference, Seoul, South Korea, November 25-27, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9558, Springer 2016, ISBN 978-3-319-30839-5 [contents] - 2015
- [j10]Gook Hwa Cho, Namhun Koo, Eunhye Ha, Soonhak Kwon:
New cube root algorithm based on the third order linear recurrence relations in finite fields. Des. Codes Cryptogr. 75(3): 483-495 (2015) - [i10]Namhun Koo, Gook Hwa Cho, Byeonghwan Go, Soonhak Kwon:
An Improvement of the Cipolla-Lehmer Type Algorithms. CoRR abs/1501.04036 (2015) - 2014
- [i9]Geon Heo, Seokhwan Choi, Kwang Ho Lee, Namhun Koo, Soonhak Kwon:
Remarks on the Pocklington and Padró-Sáez Cube Root Algorithm in 𝔽q. IACR Cryptol. ePrint Arch. 2014: 212 (2014) - 2013
- [i8]Gook Hwa Cho, Namhun Koo, Eunhye Ha, Soonhak Kwon:
New Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field. IACR Cryptol. ePrint Arch. 2013: 24 (2013) - [i7]Gook Hwa Cho, Namhun Koo, Eunhye Ha, Soonhak Kwon:
Trace Expression of r-th Root over Finite Field. IACR Cryptol. ePrint Arch. 2013: 41 (2013) - [i6]Namhun Koo, Gook Hwa Cho, Soonhak Kwon:
Square Root Algorithm in Fq for q≡2s+1 (mod 2s+1). IACR Cryptol. ePrint Arch. 2013: 87 (2013) - [i5]Namhun Koo, Gook Hwa Cho, Soonhak Kwon:
On r-th Root Extraction Algorithm in Fq For q≡lrs+1 (mod rs+1) with 0 < l < r and Small s. IACR Cryptol. ePrint Arch. 2013: 117 (2013) - 2011
- [i4]Namhun Koo, Gooc Hwa Jo, Soonhak Kwon:
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve. IACR Cryptol. ePrint Arch. 2011: 292 (2011) - 2010
- [j9]Kris Gaj, Soonhak Kwon, Patrick Baier, Paul Kohlbrenner, Hoang Le, Mohammed Khaleeluddin, Ramakrishna Bachimanchi, Marcin Rogawski:
Area-Time Efficient Implementation of the Elliptic Curve Method of Factoring in Reconfigurable Hardware for Application in the Number Field Sieve. IEEE Trans. Computers 59(9): 1264-1280 (2010)
2000 – 2009
- 2009
- [j8]Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong:
More efficient systolic arrays for multiplication in GF(2m) using LSB first algorithm with irreducible polynomials and trinomials. Comput. Electr. Eng. 35(1): 159-167 (2009) - [j7]Chang Shu, Soonhak Kwon, Kris Gaj:
Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields. IEEE Trans. Computers 58(9): 1221-1237 (2009) - 2008
- [j6]Soonhak Kwon, Taekyoung Kwon, Young-Ho Park:
New Hardware Architecture for Multiplication over GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 236-243 (2008) - [j5]Taek-Young Youn, Young-Ho Park, Taekyoung Kwon, Soonhak Kwon, Jongin Lim:
Efficient Flexible Batch Signing Techniques for Imbalanced Communication Applications. IEICE Trans. Inf. Syst. 91-D(5): 1481-1484 (2008) - [j4]Chang Shu, Soonhak Kwon, Kris Gaj:
FPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials. IET Comput. Digit. Tech. 2(1): 6-11 (2008) - [j3]Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong:
FPGA implementation of high performance elliptic curve cryptographic processor over GF. J. Syst. Archit. 54(10): 893-900 (2008) - [c27]Miaoqing Huang, Kris Gaj, Soonhak Kwon, Tarek A. El-Ghazawi:
An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm. Public Key Cryptography 2008: 214-228 - 2007
- [i3]Miaoqing Huang, Kris Gaj, Soonhak Kwon, Tarek A. El-Ghazawi:
An Optimized Hardware Architecture of Montgomery Multiplication Algorithm. IACR Cryptol. ePrint Arch. 2007: 228 (2007) - 2006
- [j2]Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong:
Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields. Des. Codes Cryptogr. 41(3): 299-306 (2006) - [c26]Kris Gaj, Soonhak Kwon, Patrick Baier, Paul Kohlbrenner, Hoang Le, Mohammed Khaleeluddin, Ramakrishna Bachimanchi:
Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware. CHES 2006: 119-133 - [c25]Chang Shu, Soonhak Kwon, Kris Gaj:
FPGA accelerated tate pairing based cryptosystems over binary fields. FPT 2006: 173-180 - [i2]Chang Shu, Soonhak Kwon, Kris Gaj:
FPGA Accelerated Tate Pairing Based Cryptosystems over Binary Fields. IACR Cryptol. ePrint Arch. 2006: 179 (2006) - 2005
- [j1]Chang Hoon Kim, Chun Pyo Hong, Soonhak Kwon:
A digit-serial multiplier for finite field GF(2m). IEEE Trans. Very Large Scale Integr. Syst. 13(4): 476-483 (2005) - [c24]Soonhak Kwon:
Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields. ACISP 2005: 134-145 - [c23]Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong:
A fast digit-serial systolic multiplier for finite field GF(2m). ASP-DAC 2005: 1268-1271 - [c22]Chang Hoon Kim, Chun Pyo Hong, Soonhak Kwon:
A Novel Arithmetic Unit over GF(2m) for Low Cost Cryptographic Applications. HPCC 2005: 524-534 - [c21]Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong, In-Gil Nam:
A New Digit-Serial Systolic Mulitplier for High Performance GF(2m) Applications. HPCC 2005: 560-566 - [c20]Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong:
Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2m) for High Speed Cryptographic Processors. ICCSA (1) 2005: 508-518 - [c19]Soonhak Kwon, Taekyoung Kwon, Young-Ho Park:
New Architecture for Multiplication in GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography. ICISC 2005: 335-351 - [c18]Soonhak Kwon, Chang Kim, Chun Pyo Hong:
Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2m) Using LSB First Algorithm. WILF 2005: 420-426 - [c17]Soonhak Kwon, Taekyoung Kwon, Young-Ho Park:
Efficient Linear Array for Multiplication over NIST Recommended Binary Fields. WILF 2005: 427-436 - 2004
- [c16]Soonhak Kwon, Kris Gaj, Chang Hoon Kim, Chun Pyo Hong:
Efficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography. CHES 2004: 76-91 - [c15]Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong:
A Linear Systolic Array for Multiplication in GF(2m) for High Speed Cryptographic Processors. ICCSA (4) 2004: 106-116 - [c14]Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong, Hiecheol Kim:
A New Systolic Array for Least Significant Digit First Multiplication in GF(2m). ICCSA (3) 2004: 656-666 - [c13]Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong:
Fast Irreducibility Testing for XTR Using a Gaussian Normal Basis of Low Complexity. Selected Areas in Cryptography 2004: 144-158 - [c12]Soonhak Kwon:
Signed Digit Representation with NAF and Balanced Ternary Form and Efficient Exponentiation in GF(qn) Using a Gaussian Normal Basis of Type II. WISA 2004: 332-344 - [i1]Soonhak Kwon:
Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields. IACR Cryptol. ePrint Arch. 2004: 303 (2004) - 2003
- [c11]Soonhak Kwon:
A Low Complexity and a Low Latency Bit Parallel Systolic Multiplier over GF(2m) Using an Optimal Normal Basis of Type II. IEEE Symposium on Computer Arithmetic 2003: 196- - [c10]Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong:
Efficient Exponentiation for a Class of Finite Fields GF(2 n) Determined by Gauss Periods. CHES 2003: 228-242 - [c9]Chang Hoon Kim, Soonhak Kwon, Jong Jin Kim, Chun Pyo Hong:
A New Arithmetic Unit in GF(2m) for Reconfigurable Hardware Implementation. FPL 2003: 670-680 - [c8]Chang Hoon Kim, Soonhak Kwon, Jong Jin Kim, Chun Pyo Hong:
A Compact and Fast Division Architecture for a Finite Field. ICCSA (1) 2003: 855-864 - [c7]Soonhak Kwon, Heuisu Ryu:
Efficient Bit Serial Multiplication in GF(2m) for a Class of Finite Fields. ICOIN 2003: 762-771 - [c6]Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong:
Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic. ISAAC 2003: 736-745 - [c5]Chang Hoon Kim, Soonhak Kwon, Chun Pyo Hong, In-Gil Nam:
Efficient bit-serial systolic array for division over GF(2m). ISCAS (2) 2003: 252-255 - [c4]Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong:
A systolic multiplier with LSB first algorithm over GF(2m) which is as efficient as the one with MSB first algorithm. ISCAS (5) 2003: 633-636 - 2002
- [c3]Soonhak Kwon:
Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields. ICICS 2002: 209-216 - [c2]Soonhak Kwon, Heuisu Ryu:
Efficient Bit Serial Multiplication Using Optimal Normal Bases of Type II in GF (2m). ISC 2002: 300-308 - 2001
- [c1]Ganghwa Lee, Yoonchul Lee, SukGyu Lee, Soonhak Kwon:
Majority-Voting FCM Algorithm in the Vague Fuzzy Classification. FUZZ-IEEE 2001: 813-815
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-07 00:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
