Hiroshi Onuki
Orcid: 0000-0002-0202-8918
According to our database1,
Hiroshi Onuki
authored at least 32 papers
between 2016 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
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
IACR Cryptol. ePrint Arch., 2025
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
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
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
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
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024
2023
Discret. Appl. Math., March, 2023
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
JSIAM Lett., 2022
The Generalized Montgomery Coordinate: A New Computational Tool for Isogeny-based Cryptography.
IACR Cryptol. ePrint Arch., 2022
Proceedings of the Public-Key Cryptography - PKC 2022, 2022
2021
2020
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
Proceedings of the Advances in Information and Computer Security, 2020
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
Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020
2019
IACR Cryptol. ePrint Arch., 2019
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