Hiroshi Onuki

Orcid: 0000-0002-0202-8918

According to our database1, Hiroshi Onuki authored at least 32 papers between 2016 and 2025.

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

2025
A collision attack on the LTZ hash function based on a conjecture on supersingular non-superspecial isogeny graphs of dimension 2.
IACR Cryptol. ePrint Arch., 2025

Attacks on PRISM-id via Torsion over Small Extension Fields.
IACR Cryptol. ePrint Arch., 2025

SQIsign2DPush: Faster Signature Scheme Using 2-Dimensional Isogenies.
IACR Cryptol. ePrint Arch., 2025

Efficient Theta-Based Algorithms for Computing (ℓ , ℓ )-Isogenies on Kummer Surfaces for Arbitrary Odd ℓ.
Proceedings of the Post-Quantum Cryptography - 16th International Workshop, 2025

An Efficient Collision Attack on Castryck-Decru-Smith's Hash Function.
Proceedings of the Post-Quantum Cryptography - 16th International Workshop, 2025

Lower Bounds of Costs of 3-Isogenies Formulas in the Framework of Generalized Montgomery Coordinates.
Proceedings of the Computer Algebra in Scientific Computing - 27th International Workshop, 2025

2024
Explicit addition formulae on hyperelliptic curves of genus 2 for isogeny-based cryptography.
JSIAM Lett., 2024

SQIsign2D-East: A New Signature Scheme Using 2-dimensional Isogenies.
IACR Cryptol. ePrint Arch., 2024

Primality proving using elliptic curves with complex multiplication by imaginary quadratic fields of class number three.
Finite Fields Their Appl., 2024

Adaptive Attacks Against FESTA Without Input Validation or Constant-Time Implementation.
Proceedings of the Post-Quantum Cryptography - 15th International Workshop, 2024

QFESTA: Efficient Algorithms and Parameters for FESTA Using Quaternion Algebras.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Ideal-to-Isogeny Algorithm Using 2-Dimensional Isogenies and Its Application to SQIsign.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

SQIsign2D-East: A New Signature Scheme Using 2-Dimensional Isogenies.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

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

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

Radical Isogenies on Montgomery Curves.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

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

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

On Collisions Related to an Ideal Class of Order 3 in CSIDH.
Proceedings of the Advances in Information and Computer Security, 2020

The Existence of Cycles in the Supersingular Isogeny Graphs Used in SIKE.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Trouble at the CSIDH: Protecting CSIDH with Dummy-Operations Against Fault Injection Attacks.
Proceedings of the 17th Workshop on Fault Detection and Tolerance in Cryptography, 2020

How to Construct CSIDH on Edwards Curves.
Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

SiGamal: A Supersingular Isogeny-Based PKE and Its Application to a PRF.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

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...