Fast Hardware Architectures for Supersingular Isogeny Diffie-Hellman Key Exchange on FPGA

DOI10.1007/978-3-319-49890-4_11zbMath1411.94071OpenAlexW2549716298MaRDI QIDQ3179485

Mehran Mozaffari-Kermani, Brian Koziel, Reza Azarderakhsh

Publication date: 21 December 2016

Published in: Progress in Cryptology – INDOCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-49890-4_11

zbMATH Keywords

field programmable gate arrayelliptic curve cryptographypost-quantum cryptographyisogeny-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

A key manipulation attack on some recent isogeny-based key agreement protocols ⋮ Faster isogenies for post-quantum cryptography: SIKE ⋮ Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling ⋮ On Fast Calculation of Addition Chains for Isogeny-Based Cryptography ⋮ On the cost of computing isogenies between supersingular elliptic curves ⋮ SIKE Round 2 Speed Record on ARM Cortex-M4 ⋮ Optimized Algorithms and Architectures for Montgomery Multiplication for Post-quantum Cryptography ⋮ How not to create an isogeny-based PAKE ⋮ Side-channel attacks on quantum-resistant supersingular isogeny Diffie-Hellman

Uses Software

• SIDH

Cites Work

• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Modular Multiplication Without Trial Division
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography
• Constructing elliptic curve isogenies in quantum subexponential time

This page was built for publication: Fast Hardware Architectures for Supersingular Isogeny Diffie-Hellman Key Exchange on FPGA