default search action
Taechan Kim 0001
Person information
- affiliation: NTT (Nippon Telegraph and Telephone Corporation) Secure Platform Laboratories, Japan
- affiliation (former): Seoul National University, South Korea
Other persons with the same name
- Taechan Kim (aka: Tae-Chan Kim, TaeChan Kim) — disambiguation page
- Tae-Chan Kim 0002 (aka: Taechan Kim 0002) — Samsung Electronics Co. Ltd., Yong-in City, Korea
- Tae-Chan Kim 0003 (aka: Taechan Kim 0003) — Korea University, ASIC Design Lab, Seoul, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c9]Taechan Kim
, Hyesun Kwak
Asymptotically Faster Multi-Key Homomorphic Encryption from Homomorphic Gadget Decomposition. CCS 2023: 726-740 - 2022
- [i6]Taechan Kim, Hyesun Kwak, Dongwon Lee, Jinyeong Seo, Yongsoo Song:
Asymptotically Faster Multi-Key Homomorphic Encryption from Homomorphic Gadget Decomposition. IACR Cryptol. ePrint Arch. 2022: 347 (2022) - 2020
- [j4]Taechan Kim
Equidistribution Among Cosets of Elliptic Curve Points in Intervals. J. Math. Cryptol. 14(1): 339-345 (2020)
2010 – 2019
- 2019
- [c8]Taechan Kim
Security Analysis of Group Action Inverse Problem with Auxiliary Inputs with Application to CSIDH Parameters. ICISC 2019: 165-174 - [i5]Jung Hee Cheon, Duhyeong Kim, Taechan Kim, Yongha Son:
A New Trapdoor over Module-NTRU Lattice and its Application to ID-based Encryption. IACR Cryptol. ePrint Arch. 2019: 1468 (2019) - 2017
- [j3]Mehdi Tibouchi
Improved elliptic curve hashing and point representation. Des. Codes Cryptogr. 82(1-2): 161-177 (2017) - [c7]Taechan Kim
Lattice Reductions over Euclidean Rings with Applications to Cryptanalysis. IMACC 2017: 371-391 - [c6]Taechan Kim
Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree. Public Key Cryptography (1) 2017: 388-408 - 2016
- [j2]Jung Hee Cheon, Taechan Kim
A new approach to the discrete logarithm problem with auxiliary inputs. LMS J. Comput. Math. 19(1): 1-15 (2016) - [c5]Taechan Kim
Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case. CRYPTO (1) 2016: 543-571 - [i4]Jinhyuck Jeong, Taechan Kim:
Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree. IACR Cryptol. ePrint Arch. 2016: 526 (2016) - 2015
- [c4]Taechan Kim
Multiple Discrete Logarithm Problems with Auxiliary Inputs. ASIACRYPT (1) 2015: 174-188 - [c3]Taechan Kim
Invalid Curve Attacks in a GLS Setting. IWSEC 2015: 41-55 - [i3]Taechan Kim:
Extended Tower Number Field Sieve: A New Complexity for Medium Prime Case. IACR Cryptol. ePrint Arch. 2015: 1027 (2015) - 2014
- [c2]Taechan Kim
Bit-Flip Faults on Elliptic Curve Base Fields, Revisited. ACNS 2014: 163-180 - 2013
- [j1]Taechan Kim
On the Final Exponentiation in Tate Pairing Computations. IEEE Trans. Inf. Theory 59(6): 4033-4041 (2013) - [c1]Jung Hee Cheon, Taechan Kim
A Group Action on ℤp˟ and the Generalized DLP with Auxiliary Inputs. Selected Areas in Cryptography 2013: 121-135 - 2012
- [i2]Taechan Kim, Sungwook Kim, Jung Hee Cheon:
Accelerating the Final Exponentiation in the Computation of the Tate Pairings. IACR Cryptol. ePrint Arch. 2012: 119 (2012) - [i1]Taechan Kim, Jung Hee Cheon:
A New Approach to Discrete Logarithm Problem with Auxiliary Inputs. IACR Cryptol. ePrint Arch. 2012: 609 (2012)
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-10-07 21:23 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: