Hiroshi Onuki

According to our database, Hiroshi Onuki authored at least 26 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Efficient theta-based algorithms for computing (ℓ, ℓ)-isogenies on Kummer surfaces for arbitrary odd ℓ.

Ryo Yoshizumi, Hiroshi Onuki, Ryo Ohashi, Momonari Kudo, Koji Nuida

IACR Cryptol. ePrint Arch., 2024

Ideal-to-isogeny algorithm using 2-dimensional isogenies and its application to SQIsign.

Hiroshi Onuki, Kohei Nakagawa

IACR Cryptol. ePrint Arch., 2024

An efficient collision attack on Castryck-Decru-Smith's hash function.

Ryo Ohashi, Hiroshi Onuki

IACR Cryptol. ePrint Arch., 2024

SQIsign2D-East: A New Signature Scheme Using 2-dimensional Isogenies.

Kohei Nakagawa, Hiroshi Onuki

IACR Cryptol. ePrint Arch., 2024

Primality proving using elliptic curves with complex multiplication by imaginary quadratic fields of class number three.

Hiroshi Onuki

Finite Fields Their Appl., 2024

Adaptive Attacks Against FESTA Without Input Validation or Constant-Time Implementation.

Tomoki Moriya, Hiroshi Onuki, Maozhi Xu, Guoqing Zhou

Proceedings of the Post-Quantum Cryptography - 15th International Workshop, 2024

2023

How to construct CSIDH on Edwards curves.

Tomoki Moriya, Hiroshi Onuki, Tsuyoshi Takagi

Finite Fields Their Appl., December, 2023

L1-norm ball for CSIDH: Optimal strategy for choosing the secret key space.

Kohei Nakagawa, Hiroshi Onuki, Atsushi Takayasu, Tsuyoshi Takagi

Discret. Appl. Math., March, 2023

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

Saki Otsuki, Hiroshi Onuki, Tsuyoshi Takagi

JSIAM Lett., 2023

QFESTA: Efficient Algorithms and Parameters for FESTA using Quaternion Algebras.

Kohei Nakagawa, Hiroshi Onuki

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.

Tomoki Moriya, Hiroshi Onuki, Yusuke Aikawa, Tsuyoshi Takagi

IACR Cryptol. ePrint Arch., 2023

2022

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

Shu Takahashi, Hiroshi Onuki, Tsuyoshi Takagi

JSIAM Lett., 2022

On the key generation in SQISign.

Hiroshi Onuki

IACR Cryptol. ePrint Arch., 2022

The Generalized Montgomery Coordinate: A New Computational Tool for Isogeny-based Cryptography.

Tomoki Moriya, Hiroshi Onuki, Yusuke Aikawa, Tsuyoshi Takagi

IACR Cryptol. ePrint Arch., 2022

2021

Radical Isogenies on Montgomery Curves.

Hiroshi Onuki, Tomoki Moriya

IACR Cryptol. ePrint Arch., 2021

On oriented supersingular elliptic curves.

Hiroshi Onuki

Finite Fields Their Appl., 2021

2020

A Constant-Time Algorithm of CSIDH Keeping Two Points.

Hiroshi Onuki, Yusuke Aikawa, Tsutomu Yamazaki, Tsuyoshi Takagi

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

The Existence of Cycles in the Supersingular Isogeny Graphs Used in SIKE.

Hiroshi Onuki, Yusuke Aikawa, Tsuyoshi Takagi

IACR Cryptol. ePrint Arch., 2020

L₁-Norm Ball for CSIDH: Optimal Strategy for Choosing the Secret Key Space.

Kohei Nakagawa, Hiroshi Onuki, Atsushi Takayasu, Tsuyoshi Takagi

IACR Cryptol. ePrint Arch., 2020

SiGamal: A supersingular isogeny-based PKE and its application to a PRF.

Tomoki Moriya, Hiroshi Onuki, Tsuyoshi Takagi

IACR Cryptol. ePrint Arch., 2020

Trouble at the CSIDH: Protecting CSIDH with Dummy-Operations against Fault Injection Attacks.

Fabio Campos, Matthias J. Kannwischer, Michael Meyer, Hiroshi Onuki, Marc Stöttinger

IACR Cryptol. ePrint Arch., 2020

2019

On collisions related to an ideal class of order 3 in CSIDH.

Hiroshi Onuki, Tsuyoshi Takagi

IACR Cryptol. ePrint Arch., 2019

A Faster Constant-time Algorithm of CSIDH keeping Two Torsion Points.

Hiroshi Onuki, Yusuke Aikawa, Tsutomu Yamazaki, Tsuyoshi Takagi

IACR Cryptol. ePrint Arch., 2019

(Short Paper) A Faster Constant-Time Algorithm of CSIDH Keeping Two Points.

Hiroshi Onuki, Yusuke Aikawa, Tsutomu Yamazaki, Tsuyoshi Takagi

Proceedings of the Advances in Information and Computer Security, 2019

2016

The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets.

Hiroshi Onuki, Tadanori Teruya, Naoki Kanayama, Shigenori Uchiyama

JSIAM Lett., 2016

Faster Explicit Formulae for Computing Pairings via Elliptic Nets and Their Parallel Computation.

Hiroshi Onuki, Tadanori Teruya, Naoki Kanayama, Shigenori Uchiyama

Proceedings of the Advances in Information and Computer Security, 2016