![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Yusuke Aikawa
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i7]Shintaro Narisada, Shusaku Uemura, Hiroki Okada, Hiroki Furue, Yusuke Aikawa, Kazuhide Fukushima:
Revisiting the May-Meurer-Thomae Algorithm - Solving McEliece-1409 in One Day. IACR Cryptol. ePrint Arch. 2024: 393 (2024) - 2023
- [i6]Tomoki Moriya, Hiroshi Onuki, Yusuke Aikawa, Tsuyoshi Takagi:
Lower bound of costs of formulas to compute image curves of 3-isogenies in the framework of generalized Montgomery coordinates. IACR Cryptol. ePrint Arch. 2023: 1511 (2023) - 2022
- [i5]Tomoki Moriya, Hiroshi Onuki, Yusuke Aikawa, Tsuyoshi Takagi:
The Generalized Montgomery Coordinate: A New Computational Tool for Isogeny-based Cryptography. IACR Cryptol. ePrint Arch. 2022: 150 (2022) - 2021
- [c4]Yuta Kambe, Yusuke Aikawa, Momonari Kudo, Masaya Yasuda, Katsuyuki Takashima, Kazuhiro Yokoyama:
Implementation Report of the Kohel-Lauter-Petit-Tignol Algorithm for the Constructive Deuring Correspondence. ICMC 2021: 953-966 - [i4]Akihiro Mizutani, Yuki Takeuchi, Ryo Hiromasa, Yusuke Aikawa, Seiichiro Tani:
Computational self-testing for entangled magic states. IACR Cryptol. ePrint Arch. 2021: 1473 (2021) - 2020
- [j2]Hiroshi Onuki
, Yusuke Aikawa, Tsutomu Yamazaki, Tsuyoshi Takagi:
A Constant-Time Algorithm of CSIDH Keeping Two Points. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1174-1182 (2020) - [c3]Tomoki Kawashima, Katsuyuki Takashima, Yusuke Aikawa, Tsuyoshi Takagi:
An Efficient Authenticated Key Exchange from Random Self-reducibility on CSIDH. ICISC 2020: 58-84 - [c2]Hiroshi Onuki, Yusuke Aikawa, Tsuyoshi Takagi:
The Existence of Cycles in the Supersingular Isogeny Graphs Used in SIKE. ISITA 2020: 358-362 - [i3]Hiroshi Onuki, Yusuke Aikawa, Tsuyoshi Takagi:
The Existence of Cycles in the Supersingular Isogeny Graphs Used in SIKE. IACR Cryptol. ePrint Arch. 2020: 439 (2020) - [i2]Tomoki Kawashima, Katsuyuki Takashima, Yusuke Aikawa, Tsuyoshi Takagi:
An Efficient Authenticated Key Exchange from Random Self-Reducibility on CSIDH. IACR Cryptol. ePrint Arch. 2020: 1178 (2020)
2010 – 2019
- 2019
- [j1]Yusuke Aikawa, Koji Nuida
, Masaaki Shirase:
Elliptic Curve Method Using Complex Multiplication Method. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(1): 74-80 (2019) - [c1]Hiroshi Onuki
, Yusuke Aikawa, Tsutomu Yamazaki, Tsuyoshi Takagi:
(Short Paper) A Faster Constant-Time Algorithm of CSIDH Keeping Two Points. IWSEC 2019: 23-33 - [i1]Hiroshi Onuki, Yusuke Aikawa, Tsutomu Yamazaki, Tsuyoshi Takagi:
A Faster Constant-time Algorithm of CSIDH keeping Two Torsion Points. IACR Cryptol. ePrint Arch. 2019: 353 (2019)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint