On fast calculation of addition chains for isogeny-based cryptography

DOI10.1007/978-3-319-54705-3_20MaRDI QIDQ2980864zbMATH OpenOpenAlexFDO

Authors Brian Koziel, Reza Azarderakhsh, David D. Yao, Mehran Mozaffari-Kermani

Publication date 5 May 2017

Published in Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-54705-3_20

zbMATH Keywords

finite fieldpost-quantum cryptographyaddition chainsisogeny-based cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Faster isogeny computation on twisted Hessian curves
• Rational isogenies from irrational endomorphisms
• Optimizing the evaluation of \(\ell\)-isogenous curve for isogeny-based cryptography
• Efficient finite field multiplication for isogeny based post quantum cryptography
• Research development on efficient elliptic curve isogenous computations

Cites work

• scientific article; zbMATH DE number 3563269 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1950620 (Why is no real title available?)
• scientific article; zbMATH DE number 1759305 (Why is no real title available?)
• scientific article; zbMATH DE number 1878322 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• A Survey of Fast Exponentiation Methods
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Analysis of sliding window techniques for exponentiation
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Efficient compression of SIDH public keys
• Fast hardware architectures for supersingular isogeny Diffie-Hellman key exchange on FPGA
• Modular Multiplication Without Trial Division
• On the computation of square roots in finite fields
• Square Root Computation over Even Extension Fields
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

Cited in

(5)

• Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
• Efficient post-quantum undeniable signature on 64-bit ARM
• Computational problems in supersingular elliptic curve isogenies
• A note on (2, 2)-isogenies via theta coordinates
• Side-channel attacks on quantum-resistant supersingular isogeny Diffie-Hellman

Describes a project that uses

Uses Software

• SIDH

This page was built for publication: On fast calculation of addition chains for isogeny-based cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980864)