Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Masaya Yasuda"'
Publikováno v:
Discrete Applied Mathematics. 318:69-81
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75d8f24689f4fbb6cfe32772223b87f8
https://doi.org/10.1016/j.dam.2022.04.018
https://doi.org/10.1016/j.dam.2022.04.018
Autor:
Nariaki Tateiwa, Yuji Shinano, Masaya Yasuda, Shizuo Kaji, Keiichiro Yamamura, Katsuki Fujisawa
Publikováno v:
Japan Journal of Industrial and Applied Mathematics.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fc8163913401ef2f74aa944e552f29b
https://doi.org/10.1007/s13160-023-00580-z
https://doi.org/10.1007/s13160-023-00580-z
Autor:
Masaya Yasuda, Satoshi Nakamura
Publikováno v:
Discrete Applied Mathematics. 304:220-229
Lattice problems are algorithmic problems for lattices, whose hardness assures the security of lattice-based cryptography. Given a basis of a lattice, the goal of lattice basis reduction is to seek a new basis of the same lattice whose basis vectors
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::160e086b6efb79b9403e6ac45252ca32
https://doi.org/10.1016/j.dam.2021.07.035
https://doi.org/10.1016/j.dam.2021.07.035
Publikováno v:
Commentarii mathematici Universitatis Sancti Pauli = Rikkyo Daigaku sugaku zasshi. 68:93-130
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::a127184e6a9e1b7b57771a42d51321a4
http://id.nii.ac.jp/1062/00020348/
http://id.nii.ac.jp/1062/00020348/
Autor:
Yasuhiko Ikematsu, Momonari Kudo, Yasushi Takahashi, Masaya Yasuda, Kazuhiro Yokoyama, Ryoya Fukasaku
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbaf3eeacfa2049337aaccb219de4189
https://doaj.org/article/3ba2f1827cf246d99016113ef3aee61b
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e80c5dd0ed981c24ad8aef2493f407e
https://doi.org/10.1515/jmc-2019-0029
https://doi.org/10.1515/jmc-2019-0029
Publikováno v:
Information Security Journal: A Global Perspective. 30:219-234
As widespread development of biometrics, concerns about security and privacy are rapidly increasing. Secure matrix computation is one of the most fundamental and useful operations for statistical a...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e42f996f6bd27a976b075265a975de52
https://doi.org/10.1080/19393555.2020.1836288
https://doi.org/10.1080/19393555.2020.1836288
Autor:
Masaya Yasuda
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::96f15f828cc631035a11e614d74c1439
https://doi.org/10.1515/jmc-2015-0053
https://doi.org/10.1515/jmc-2015-0053
Publikováno v:
Designs, Codes and Cryptography. 88:2077-2100
Lattice basis reduction is a mandatory tool for solving lattice problems such as the shortest vector problem. The Lenstra–Lenstra–Lovasz reduction algorithm (LLL) is the most famous, and its typical improvements are the block Korkine–Zolotarev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::979a81aa608fac843adb701459d6a693
https://doi.org/10.1007/s10623-020-00765-4
https://doi.org/10.1007/s10623-020-00765-4
Autor:
Pradeep Kumar Mishra, Koha Kinjo, Satoshi Nakamura, Dung Hoang Duong, Huy Quoc Le, Masaya Yasuda
Publikováno v:
IET Information Security. 14:286-303
The modulus switching technique has been used in some cryptographic applications as well as in cryptanalysis. For cryptanalysis against the learning with errors (LWE) problem and the learning with rounding (LWR) problem, it seems that one does not kn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b24f3b3be8af750edb0343f22e4d234d
https://doi.org/10.1049/iet-ifs.2019.0220
https://doi.org/10.1049/iet-ifs.2019.0220