Skip to content
Open access

Side-Channel Secure CSIDH with Projective Coordinates

Aug 2026 · IACR Communications in Cryptology · Vol 3 · 0 citations · 65 references

TL;DR

This work presents the first masked version of CSIDH and, in fact, any isogeny-based scheme and develops gadgets to efficiently mask all arithmetics in the underlying finite field and proves them secure in the d -probing model.

Abstract

CSIDH is an isogeny-based Non-Interactive Key Exchange (NIKE) proposed at ASIACRYPT'18. In this work, we present the first masked version of CSIDH and, in fact, any isogeny-based scheme. We develop gadgets to efficiently mask all arithmetics in the underlying finite field and prove them secure in the d -probing model. In particular, we develop new gadgets for the Montgomery ladder using the fact that projective values already represent a multiplicative sharing in two variables. The technique (dubbed quotient masking) might be of independent interest. Lastly, we provide an efficient implementation based on High-Security CSIDH (Communications in Cryptology 2024). We show that the relative computational overhead of masking the latter—compared to other state-of-the-art CSIDH implementations—is similar to other masked implementations of post-quantum cryptography primitives.

Read PDF

Similar papers

Sep 2026

A quantum secure novel identity-based signcryption scheme based on group ring

This study proposes a novel signcryption scheme based on the algebraic structure of the group ring and proves its provable security, and shows that the security of the scheme relies on the intractability of two hard problems, i.e., bilinear Diffie–Hellman inversion in group ring and bilinear strong Diffie–Hellman assum...

Sunil Kumar, Gaurav Mittal, Arvind Yadav · 0 citations
Open access Aug 2026

An analysis of a weakened version of PRISM

This work shows that when a weak primality test is used, the assumption underlying the security proof in the standard model does not hold, and extends the analysis to the assumption used in the security proof in the (quantum) random oracle model.

Jolijn Cottaar, S. Galbraith, Luciano Maino et al. · 1 citation

Design and Analysis of Four-State Quantum Public-Key Encryption Scheme

This paper analyzes the four-state QPKE scheme of Liu et al. and shows that its ciphertext structure leaks information about computational-basis plaintexts, and proposes sQPKE, a simple quantum public-key encryption scheme that uses only elementary operations.

Rahul Kumar, Vikas Srivastava · 0 citations
Open access Sep 2026

BB84 with ML-KEM Decapsulation-Failure-Based Security Parameters

This paper suggests that as a key exchange mechanism, BB84 should be run with security parameters comparable to those of ML-KEM, and analyzes performance implications if this choice is taken, and offers general guidelines for BB84 parameter selection.

Sara Nikula, Mari Muurman · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.