Hiroshi Onuki

Orcid: 0000-0002-0202-8918

According to our database1, Hiroshi Onuki authored at least 20 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
How to construct CSIDH on Edwards curves.
Finite Fields Their Appl., December, 2023

L1-norm ball for CSIDH: Optimal strategy for choosing the secret key space.
Discret. Appl. Math., March, 2023

Improvement of the square-root Vélu's formulas for isogeny-based cryptography.
JSIAM Lett., 2023

QFESTA: Efficient Algorithms and Parameters for FESTA using Quaternion Algebras.
IACR Cryptol. ePrint Arch., 2023

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

2022
Explicit construction of the square-root Vélu's formula on Edwards curves.
JSIAM Lett., 2022

On the key generation in SQISign.
IACR Cryptol. ePrint Arch., 2022

The Generalized Montgomery Coordinate: A New Computational Tool for Isogeny-based Cryptography.
IACR Cryptol. ePrint Arch., 2022

2021
Radical Isogenies on Montgomery Curves.
IACR Cryptol. ePrint Arch., 2021

On oriented supersingular elliptic curves.
Finite Fields Their Appl., 2021

2020
A Constant-Time Algorithm of CSIDH Keeping Two Points.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

The Existence of Cycles in the Supersingular Isogeny Graphs Used in SIKE.
IACR Cryptol. ePrint Arch., 2020

L<sub>1</sub>-Norm Ball for CSIDH: Optimal Strategy for Choosing the Secret Key Space.
IACR Cryptol. ePrint Arch., 2020

SiGamal: A supersingular isogeny-based PKE and its application to a PRF.
IACR Cryptol. ePrint Arch., 2020

Trouble at the CSIDH: Protecting CSIDH with Dummy-Operations against Fault Injection Attacks.
IACR Cryptol. ePrint Arch., 2020

2019
On collisions related to an ideal class of order 3 in CSIDH.
IACR Cryptol. ePrint Arch., 2019

A Faster Constant-time Algorithm of CSIDH keeping Two Torsion Points.
IACR Cryptol. ePrint Arch., 2019

(Short Paper) A Faster Constant-Time Algorithm of CSIDH Keeping Two Points.
Proceedings of the Advances in Information and Computer Security, 2019

2016
The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets.
JSIAM Lett., 2016

Faster Explicit Formulae for Computing Pairings via Elliptic Nets and Their Parallel Computation.
Proceedings of the Advances in Information and Computer Security, 2016


  Loading...