Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Taechan Kim"'
Autor:
Taechan Kim
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030409203
ICISC
ICISC
In this paper, we consider the security of a problem called Group Action Inverse Problem with Auxiliary Inputs (GAIPwAI). The Group Action Inverse Problem (GAIP) plays an important role in the security of several isogeny-based cryptosystems, such as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f327d442a12529ab79614a9e77157fa
https://doi.org/10.1007/978-3-030-40921-0_10
https://doi.org/10.1007/978-3-030-40921-0_10
Autor:
Taechan Kim, Mehdi Tibouchi
Publikováno v:
Designs, Codes and Cryptography. 82:161-177
For a large class of functions $$f:\mathbb {F}_q\rightarrow E(\mathbb {F}_q)$$f:FqźE(Fq) to the group of points of an elliptic curve $$E/\mathbb {F}_q$$E/Fq (typically obtained from certain algebraic correspondences between E and $$\mathbb {P}^1$$P1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8411a7e3184cb126f29806a4b5f1d9e6
https://doi.org/10.1007/s10623-016-0288-2
https://doi.org/10.1007/s10623-016-0288-2
Autor:
Taechan Kim, Jung Hee Cheon
Publikováno v:
LMS Journal of Computation and Mathematics. 19:1-15
The aim of the discrete logarithm problem with auxiliary inputs is to solve for ${\it\alpha}$, given the elements $g,g^{{\it\alpha}},\ldots ,g^{{\it\alpha}^{d}}$ of a cyclic group $G=\langle g\rangle$, of prime order $p$. The best-known algorithm, pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::334bcf1b7c1775667b09382e0a29a3f7
https://doi.org/10.1112/s1461157015000303
https://doi.org/10.1112/s1461157015000303
Autor:
Jinhyuck Jeong, Taechan Kim
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662543641
Public Key Cryptography (1)
Public Key Cryptography (1)
We propose a generalization of exTNFS algorithm recently introduced by Kim and Barbulescu (CRYPTO 2016). The algorithm, exTNFS, is a state-of-the-art algorithm for discrete logarithm in \(\mathbb {F}_{p^n}\) in the medium prime case, but it only appl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cb22a29677b740678674349f783ccc2
https://doi.org/10.1007/978-3-662-54365-8_16
https://doi.org/10.1007/978-3-662-54365-8_16
Autor:
Changmin Lee, Taechan Kim
Publikováno v:
Cryptography and Coding ISBN: 9783319710440
IMACC
IMACC
Lattices over number fields arise from various fascinating applications in cryptography. In this paper, we present two algorithms that find a nice, short basis of lattices over arbitrary Euclidean domains. One of the algorithms finds a reduced basis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ea524c1ea8484fd9c09084020cc47d3
https://doi.org/10.1007/978-3-319-71045-7_19
https://doi.org/10.1007/978-3-319-71045-7_19
Publikováno v:
IEEE Transactions on Information Theory. 59:4033-4041
The Tate pairing computation consists of two parts: Miller step and final exponentiation step. In this paper, we investigate the structure of the final exponentiation step. Consider an order r subgroup of an elliptic curve defined over Fq with embedd
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cb5720c9442b79d55af469cae49dc2f
https://doi.org/10.1109/tit.2013.2240763
https://doi.org/10.1109/tit.2013.2240763
Autor:
Taechan Kim, Razvan Barbulescu
Publikováno v:
CRYPTO 2016
CRYPTO 2016, International association of cryptologic research, Aug 2016, Santa Barbara, United States. pp.543-571
Advances in Cryptology – CRYPTO 2016 ISBN: 9783662530177
CRYPTO (1)
CRYPTO 2016, International association of cryptologic research, Aug 2016, Santa Barbara, United States. pp.543-571
Advances in Cryptology – CRYPTO 2016 ISBN: 9783662530177
CRYPTO (1)
We introduce a new variant of the number field sieve algorithm for discrete logarithms in $$\mathbb {F}_{p^n}$$ called exTNFS. The most important modification is done in the polynomial selection step, which determines the cost of the whole algorithm:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::595db204fdd37e98e4445185b795e3cc
https://hal.archives-ouvertes.fr/hal-01281966/file/KimBarbulescu.pdf
https://hal.archives-ouvertes.fr/hal-01281966/file/KimBarbulescu.pdf
Autor:
Taechan Kim, Mehdi Tibouchi
Publikováno v:
Advances in Information and Computer Security ISBN: 9783319224244
IWSEC
IWSEC
In recent years, most speed records for implementations of elliptic curve cryptosystems have been achieved on curves endowed with nontrivial fast endomorphisms, particularly based on the technique introduced by Galbraith, Lin and Scott GLS. Therefore
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1eeca28cdcf5b0a92369d19ada85e264
https://doi.org/10.1007/978-3-319-22425-1_3
https://doi.org/10.1007/978-3-319-22425-1_3
Autor:
Taechan Kim
Publikováno v:
Advances in Cryptology--ASIACRYPT 2015 ISBN: 9783662487969
ASIACRYPT (1)
ASIACRYPT (1)
Let g be an element of prime order p in an abelian group and let $$\alpha _1, \dots , \alpha _L \in {\mathbb Z}_p$$ for a positive integer L. First, we show that, if $$g, g^{\alpha _i}$$, and $$g^{\alpha _i^d}$$$$i=1, \dots , L$$ are given for $$d \m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1022f1888c67a9e52540445b90cde660
https://doi.org/10.1007/978-3-662-48797-6_8
https://doi.org/10.1007/978-3-662-48797-6_8
Publikováno v:
Algebraic Curves and Finite Fields ISBN: 9783110317886
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd511267938c0acf6db70790ea0a1066
https://doi.org/10.1515/9783110317916.71
https://doi.org/10.1515/9783110317916.71