ScholarLens Back to search
2020•Unpublished venueRequires access

Speeding up CSIDH using parallel computation of isogeny

Ganma Kato, Koutarou Suzuki

Open publisher page 2 citations

Abstract

Isogeny-based cryptography is a promising candidate for post-quantum cryptography. CSIDH is a Diffie-Hellman key exchange protocol based on isogeny with a small public key size and is secure against a quantum computer. However, one of the problems is that it takes a long time to compute the group action corresponding to the secret key. Several efficiency improvements have already been studied, such as the SIMBA technique by Meyer, Campos, and Reith, and the two-point method by Onuki, Aikawa, Yamazaki, and Takagi. In this paper, we propose parallel computation method for the isogeny in CSIDH, which speeds up the computation of the isogeny from O(d) to O(logd), where d = (ℓ-1)/2 and ℓ is the degree of the isogeny.

About this research paper

What this paper is about

Isogeny-based cryptography is a promising candidate for post-quantum cryptography. CSIDH is a Diffie-Hellman key exchange protocol based on isogeny with a small public key size and is secure against a quantum computer. However, one of the problems is that it takes a long time to compute the group action corresponding to the secret key. Several efficiency improvements have already been studied, such as the SIMBA technique by Meyer, Campos, and Reith, and the two-point method by Onuki, Aikawa, Yamazaki, and Takagi. In this paper, we propose parallel computation method for the isogeny in CSIDH, which speeds up the computation of the isogeny from O(d) to O(logd), where d = (ℓ-1)/2 and ℓ is the degree of the isogeny.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Isogeny-based cryptography is a promising candidate for post-quantum cryptography. CSIDH is a Diffie-Hellman key exchange protocol based on isogeny with a small public key size and is secure against a quantum computer. However, one of the problems is that it takes a long time to compute the group action corresponding to the secret key. Several efficiency improvements have already been studied, such as the SIMBA technique by Meyer, Campos, and Reith, and the two-point method by Onuki, Aikawa, Yamazaki, and Takagi. In this paper, we propose parallel computation method for the isogeny in CSIDH, which speeds up the computation of the isogeny from O(d) to O(logd), where d = (ℓ-1)/2 and ℓ is the degree of the isogeny.

Key concepts: Isogeny, Key exchange, Post-quantum cryptography, Cryptography, Computation, Quantum computer, Computer science, Public-key cryptography

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Speeding up CSIDH using parallel computation of isogeny — Research Paper | ScholarLens