default search action
Hiroshi Onuki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Hiroshi Onuki
:
Primality proving using elliptic curves with complex multiplication by imaginary quadratic fields of class number three. Finite Fields Their Appl. 99: 102490 (2024) - [c10]Kohei Nakagawa, Hiroshi Onuki:
QFESTA: Efficient Algorithms and Parameters for FESTA Using Quaternion Algebras. CRYPTO (5) 2024: 75-106 - [c9]Tomoki Moriya, Hiroshi Onuki
Adaptive Attacks Against FESTA Without Input Validation or Constant-Time Implementation. PQCrypto (2) 2024: 3-19 - [i15]Kohei Nakagawa, Hiroshi Onuki:
SQIsign2D-East: A New Signature Scheme Using 2-dimensional Isogenies. IACR Cryptol. ePrint Arch. 2024: 771 (2024) - [i14]Hiroshi Onuki, Kohei Nakagawa:
Ideal-to-isogeny algorithm using 2-dimensional isogenies and its application to SQIsign. IACR Cryptol. ePrint Arch. 2024: 778 (2024) - [i13]Ryo Yoshizumi, Hiroshi Onuki, Ryo Ohashi, Momonari Kudo, Koji Nuida:
Efficient theta-based algorithms for computing (ℓ, ℓ)-isogenies on Kummer surfaces for arbitrary odd ℓ. IACR Cryptol. ePrint Arch. 2024: 1519 (2024) - 2023
- [j7]Kohei Nakagawa
L1-norm ball for CSIDH: Optimal strategy for choosing the secret key space. Discret. Appl. Math. 328: 70-88 (2023) - [j6]Tomoki Moriya
How to construct CSIDH on Edwards curves. Finite Fields Their Appl. 92: 102310 (2023) - [j5]Saki Otsuki, Hiroshi Onuki
Improvement of the square-root Vélu's formulas for isogeny-based cryptography. JSIAM Lett. 15: 61-64 (2023) - [i12]Kohei Nakagawa, Hiroshi Onuki:
QFESTA: Efficient Algorithms and Parameters for FESTA using Quaternion Algebras. IACR Cryptol. ePrint Arch. 2023: 1468 (2023) - [i11]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
- [j4]Shu Takahashi, Hiroshi Onuki
Explicit construction of the square-root Vélu's formula on Edwards curves. JSIAM Lett. 14: 108-110 (2022) - [c8]Hiroshi Onuki
Radical Isogenies on Montgomery Curves. Public Key Cryptography (1) 2022: 473-497 - [i10]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) - [i9]Hiroshi Onuki:
On the key generation in SQISign. IACR Cryptol. ePrint Arch. 2022: 900 (2022) - 2021
- [j3]Hiroshi Onuki
On oriented supersingular elliptic curves. Finite Fields Their Appl. 69: 101777 (2021) - [i8]Hiroshi Onuki, Tomoki Moriya:
Radical Isogenies on Montgomery Curves. IACR Cryptol. ePrint Arch. 2021: 699 (2021) - 2020
- [j2]Hiroshi Onuki
A Constant-Time Algorithm of CSIDH Keeping Two Points. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1174-1182 (2020) - [c7]Tomoki Moriya
SiGamal: A Supersingular Isogeny-Based PKE and Its Application to a PRF. ASIACRYPT (2) 2020: 551-580 - [c6]Tomoki Moriya
How to Construct CSIDH on Edwards Curves. CT-RSA 2020: 512-537 - [c5]Fabio Campos
Trouble at the CSIDH: Protecting CSIDH with Dummy-Operations Against Fault Injection Attacks. FDTC 2020: 57-65 - [c4]Hiroshi Onuki, Yusuke Aikawa, Tsuyoshi Takagi:
The Existence of Cycles in the Supersingular Isogeny Graphs Used in SIKE. ISITA 2020: 358-362 - [c3]Hiroshi Onuki
On Collisions Related to an Ideal Class of Order 3 in CSIDH. IWSEC 2020: 131-148 - [i7]Kohei Nakagawa, Hiroshi Onuki, Atsushi Takayasu, Tsuyoshi Takagi:
L1-Norm Ball for CSIDH: Optimal Strategy for Choosing the Secret Key Space. IACR Cryptol. ePrint Arch. 2020: 181 (2020) - [i6]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) - [i5]Tomoki Moriya, Hiroshi Onuki, Tsuyoshi Takagi:
SiGamal: A supersingular isogeny-based PKE and its application to a PRF. IACR Cryptol. ePrint Arch. 2020: 613 (2020) - [i4]Fabio Campos, Matthias J. Kannwischer, Michael Meyer, Hiroshi Onuki, Marc Stöttinger:
Trouble at the CSIDH: Protecting CSIDH with Dummy-Operations against Fault Injection Attacks. IACR Cryptol. ePrint Arch. 2020: 1005 (2020)
2010 – 2019
- 2019
- [c2]Hiroshi Onuki
(Short Paper) A Faster Constant-Time Algorithm of CSIDH Keeping Two Points. IWSEC 2019: 23-33 - [i3]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) - [i2]Tomoki Moriya, Hiroshi Onuki, Tsuyoshi Takagi:
How to Construct CSIDH on Edwards Curves. IACR Cryptol. ePrint Arch. 2019: 843 (2019) - [i1]Hiroshi Onuki, Tsuyoshi Takagi:
On collisions related to an ideal class of order 3 in CSIDH. IACR Cryptol. ePrint Arch. 2019: 1209 (2019) - 2016
- [j1]Hiroshi Onuki
The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets. JSIAM Lett. 8: 9-12 (2016) - [c1]Hiroshi Onuki
Faster Explicit Formulae for Computing Pairings via Elliptic Nets and Their Parallel Computation. IWSEC 2016: 319-334
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:19 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: