On Fast Calculation of Addition Chains for Isogeny-Based Cryptography

DOI10.1007/978-3-319-54705-3_20zbMath1404.94087OpenAlexW2591576425MaRDI QIDQ2980864

Reza Azarderakhsh, David D. W. Yao, Brian Koziel, 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)

Related Items (4)

Optimized Algorithms and Architectures for Montgomery Multiplication for Post-quantum Cryptography ⋮ Side-channel attacks on quantum-resistant supersingular isogeny Diffie-Hellman ⋮ Efficient post-quantum undeniable signature on 64-bit ARM ⋮ Computational problems in supersingular elliptic curve isogenies

Uses Software

• SIDH

Cites Work

• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• On the computation of square roots in finite fields
• Analysis of sliding window techniques for exponentiation
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Fast Hardware Architectures for Supersingular Isogeny Diffie-Hellman Key Exchange on FPGA
• Modular Multiplication Without Trial Division
• A Survey of Fast Exponentiation Methods
• Square Root Computation over Even Extension Fields
• Efficient Compression of SIDH Public Keys
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Fast Calculation of Addition Chains for Isogeny-Based Cryptography