default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChang Han Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j7]Sung Min Cho, Seung Gyu Gwak, Chang Han Kim, Seokhie Hong:
Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations. Multim. Tools Appl. 75(22): 14819-14831 (2016)- 2012
- [j6]Young In Cho, Nam Su Chang, Chang Han Kim, Young-Ho Park
, Seokhie Hong:
New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over GF(2n). IEEE Trans. Very Large Scale Integr. Syst. 20(10): 1903-1908 (2012) - 2011
- [c13]Chang Han Kim, Nam Su Chang, Young In Cho:
Modified Sequential Multipliers for Type-k Gaussian Normal Bases. MUE 2011: 220-225 - 2010
- [j5]Nam Su Chang, Tae Hyun Kim, Chang Han Kim, Dong-Guk Han, Jongin Lim:
A new bit-serial multiplier over GF(pm) using irreducible trinomials. Comput. Math. Appl. 60(2): 355-361 (2010)
2000 – 2009
- 2009
- [j4]Daesung Lim, Nam Su Chang, Sung Yeon Ji, Chang Han Kim, Sangjin Lee, Young-Ho Park:
An efficient signed digit montgomery multiplication for RSA. J. Syst. Archit. 55(7-9): 355-362 (2009) - 2008
- [j3]Taek-Young Youn, Young-Ho Park, Chang Han Kim, Jongin Lim:
Weakness in a RSA-based password authenticated key exchange protocol. Inf. Process. Lett. 108(6): 339-342 (2008) - 2006
- [c12]Chang Han Kim, Yongtae Kim, Sung Yeon Ji, IlHwan Park:
A New Parallel Multiplier for Type II Optimal Normal Basis. CIS 2006: 460-469 - [c11]Yongtae Kim, Chang Han Kim, Taek-Young Youn:
On the Security of Multilevel Cryptosystems over Class Semigroups of Imaginary Quadratic Non-maximal Orders. EuroPKI 2006: 92-100 - [c10]Taek-Young Youn, Young-Ho Park, Chang Han Kim, Jongin Lim:
An Efficient ID-Based Delegation Network. OTM Workshops (1) 2006: 382-391 - 2005
- [c9]Sosun Kim, Nam Su Chang, Chang Han Kim, Young-Ho Park, Jongin Lim:
A Fast Inversion Algorithm and Low-Complexity Architecture over GF(2m). CIS (2) 2005: 1-8 - [c8]Dong Jin Yang, Chang Han Kim, Young-Ho Park, Yongtae Kim, Jongin Lim:
Modified Sequential Normal Basis Multipliers for Type II Optimal Normal Bases. ICCSA (2) 2005: 647-656 - [c7]Chang Han Kim, Yongtae Kim, Nam Su Chang, IlHwan Park:
Modified Serial Multipliers for Type-IV Gaussian Normal Bases. INDOCRYPT 2005: 375-388 - [c6]Nam Su Chang, Chang Han Kim, Young-Ho Park, Jongin Lim:
A Non-redundant and Efficient Architecture for Karatsuba-Ofman Algorithm. ISC 2005: 288-299 - [c5]Taek-Young Youn, Young-Ho Park, Chang Han Kim, Jongin Lim:
An Efficient Public Key Cryptosystem with a Privacy Enhanced Double Decryption Mechanism. Selected Areas in Cryptography 2005: 144-158 - 2003
- [c4]Dong-Guk Han, Nam Su Chang, Seok Won Jung, Young-Ho Park, Chang Han Kim, Heuisu Ryu:
Cryptanalysis of the Full Version Randomized Addition-Subtraction Chains. ACISP 2003: 67-78 - [c3]Seon Ok Lee, Seok Won Jung, Chang Han Kim, Janghong Yoon, Jae-Young Koh, Daeho Kim:
Design of Bit Parallel Multiplier with Lower Time Complexity. ICISC 2003: 127-139 - 2002
- [j2]Chang Han Kim, Sangho Oh, Jongin Lim:
A New Hardware Architecture for Operations in GF(2m). IEEE Trans. Computers 51(1): 90-92 (2002) - [c2]Young-Ho Park, Sangtae Jeong, Chang Han Kim, Jongin Lim:
An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves. Public Key Cryptography 2002: 323-334 - [c1]Dong-Guk Han, Ki Soon Yoon, Young-Ho Park, Chang Han Kim, Jongin Lim:
Optimal Extension Fields for XTR. Selected Areas in Cryptography 2002: 369-384 - 2000
- [j1]Sangho Oh, Chang Han Kim, Jongin Lim, Dong Hyeon Cheon:
Efficient Normal Basis Multipliers in Composite Fields. IEEE Trans. Computers 49(10): 1133-1138 (2000)
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 2025-01-09 13:06 CET 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:
