Optimized Algorithms and Architectures for Montgomery Multiplication for Post-quantum Cryptography

DOI10.1007/978-3-030-31578-8_5zbMath1444.94066OpenAlexW2979615834MaRDI QIDQ3297615

Rami Elkhatib, Reza Azarderakhsh, Mehran Mozaffari-Kermani

Publication date: 20 July 2020

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-31578-8_5

zbMATH Keywords

post-quantum cryptographyMontgomery multiplicationisogeny-based cryptosystemshardware architectures

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Faster isogenies for post-quantum cryptography: SIKE

Cites Work

• Unnamed Item
• Parallel crypto-devices for GF\((p)\) elliptic curve multiplication resistant against side channel attacks
• On Fast Calculation of Addition Chains for Isogeny-Based Cryptography
• 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 High-Performance and Scalable Hardware Architecture for Isogeny-Based Cryptography

This page was built for publication: Optimized Algorithms and Architectures for Montgomery Multiplication for Post-quantum Cryptography