Zobrazeno 1 - 10
of 73
pro vyhledávání: '"YASUDA, Masaya"'
Publikováno v:
In Discrete Applied Mathematics 15 September 2022 318:69-81
Autor:
Nakamura, Satoshi, Yasuda, Masaya
Publikováno v:
In Discrete Applied Mathematics 15 December 2021 304:220-229
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Takahashi Yasushi, Kudo Momonari, Fukasaku Ryoya, Ikematsu Yasuhiko, Yasuda Masaya, Yokoyama Kazuhiro
Publikováno v:
Journal of Mathematical Cryptology, Vol 15, Iss 1, Pp 31-44 (2020)
Recently, supersingular isogeny cryptosystems have received attention as a candidate of post-quantum cryptography (PQC). Their security relies on the hardness of solving isogeny problems over supersingular elliptic curves. The meet-in-the-middle appr
Externí odkaz:
https://doaj.org/article/3ba2f1827cf246d99016113ef3aee61b
Publikováno v:
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 460-485 (2020)
Since Semaev introduced summation polynomials in 2004, a number of studies have been devoted to improving the index calculus method for solving the elliptic curve discrete logarithm problem (ECDLP) with better complexity than generic methods such as
Externí odkaz:
https://doaj.org/article/bb64b7a98fd2462c84a20ffe0d32dd6b
Autor:
Yasuda Masaya
Publikováno v:
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 84-94 (2020)
In recent years, the block Korkine-Zolotarev (BKZ) and its variants such as BKZ 2.0 have been used as de facto algorithms to estimate the security of a lattice-based cryptosystem. In 2017, DeepBKZ was proposed as a mathematical improvement of BKZ, wh
Externí odkaz:
https://doaj.org/article/8f21ae56bc1b491989d096804a1562c4
Autor:
Katayama, Akira, Yasuda, Masaya
Publikováno v:
Japan Journal of Industrial & Applied Mathematics; May2024, Vol. 41 Issue 2, p919-943, 25p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tateiwa, Nariaki, Shinano, Yuji, Yasuda, Masaya, Kaji, Shizuo, Yamamura, Keiichiro, Fujisawa, Katsuki
Publikováno v:
Japan Journal of Industrial & Applied Mathematics; Jan2024, Vol. 41 Issue 1, p13-56, 44p
Publikováno v:
Journal of Mathematical Cryptology, Vol 11, Iss 1, Pp 1-24 (2017)
In 2015, Fukase and Kashiwabara proposed an efficient method to find a very short lattice vector. Their method has been applied to solve Darmstadt shortest vector problems of dimensions 134 to 150. Their method is based on Schnorr’s random sampling
Externí odkaz:
https://doaj.org/article/8cb832d029e54d99b78edce1c77dbd08