Follow
Hiroshi Onuki
Hiroshi Onuki
Verified email at mist.i.u-tokyo.ac.jp
Title
Cited by
Cited by
Year
(Short Paper) A faster constant-time algorithm of CSIDH keeping two points
H Onuki, Y Aikawa, T Yamazaki, T Takagi
Advances in Information and Computer Security: 14th International Workshop …, 2019
362019
On oriented supersingular elliptic curves
H Onuki
Finite Fields and Their Applications 69, 101777, 2021
242021
SiGamal: a supersingular isogeny-based PKE and its application to a PRF
T Moriya, H Onuki, T Takagi
Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the …, 2020
242020
How to construct CSIDH on Edwards curves
T Moriya, H Onuki, T Takagi
Topics in Cryptology–CT-RSA 2020: The Cryptographers’ Track at the RSA …, 2020
152020
l1-norm ball for CSIDH: optimal strategy for choosing the secret key space
K Nakagawa, H Onuki, A Takayasu, T Takagi
Discrete Applied Mathematics 328, 70-88, 2023
122023
Trouble at the CSIDH: protecting CSIDH with dummy-operations against fault injection attacks
F Campos, MJ Kannwischer, M Meyer, H Onuki, M Stöttinger
2020 Workshop on Fault Detection and Tolerance in Cryptography (FDTC), 57-65, 2020
112020
On collisions related to an ideal class of order 3 in CSIDH
H Onuki, T Takagi
Advances in Information and Computer Security: 15th International Workshop …, 2020
112020
The existence of cycles in the supersingular isogeny graphs used in SIKE
H Onuki, Y Aikawa, T Takagi
2020 International Symposium on Information Theory and Its Applications …, 2020
92020
A constant-time algorithm of CSIDH keeping two points
H Onuki, Y Aikawa, T Yamazaki, T Takagi
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2020
62020
Radical isogenies on montgomery curves
H Onuki, T Moriya
Public-Key Cryptography–PKC 2022: 25th IACR International Conference on …, 2022
52022
The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
H Onuki, T Teruya, N Kanayama, S Uchiyama
JSIAM Letters 8, 9-12, 2016
52016
Faster explicit formulae for computing pairings via elliptic nets and their parallel computation
H Onuki, T Teruya, N Kanayama, S Uchiyama
Advances in Information and Computer Security: 11th International Workshop …, 2016
32016
A primality proving using elliptic curves with complex multiplication by imaginary quadratic fields of class number three
H Onuki
arXiv preprint arXiv:2211.15137, 2022
12022
The generalized montgomery coordinate: A new computational tool for isogeny-based cryptography
T Moriya, H Onuki, Y Aikawa, T Takagi
Cryptology ePrint Archive, 2022
12022
Explicit construction of the square-root Vélu's formula on Edwards curves
S Takahashi, H Onuki, T Takagi
JSIAM Letters 14, 108-110, 2022
2022
On the key generation in SQISign
H Onuki
Cryptology ePrint Archive, 2022
2022
Faster Explicit Formulae and Parallelization for Computation of Pairings Using Elliptic Nets
H Onuki
首都大学東京, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–17