Efficient finite field multiplication for isogeny based post quantum cryptography

DOI10.1007/978-3-319-55227-9_14zbMATH Open1409.94882OpenAlexW2605112356MaRDI QIDQ5267802FDOQ5267802

Authors Angshuman Karmakar, Sujoy Sinha Roy, Frederik Vercauteren, Ingrid Verbauwhede

Publication date 13 June 2017

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL http://pure-oai.bham.ac.uk/ws/files/89865204/Efficient_Finite_Field.pdf

zbMATH Keywords

isogenypost-quantum cryptographymodular multiplication

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
• Research development on efficient elliptic curve isogenous computations
• Faster isogeny computation on twisted Hessian curves
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

Cites work

• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• Claw finding algorithms using quantum walk
• Constructing elliptic curve isogenies in quantum subexponential time
• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• Cryptographic hash functions from expander graphs
• Improved algorithm for the isogeny problem for ordinary elliptic curves
• Isogeny-based quantum-resistant undeniable signatures
• Modular Multiplication Without Trial Division
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Rainbow, a New Multivariable Polynomial Signature Scheme
• The Arithmetic of Elliptic Curves
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

Cited in

(11)

• An alternative approach for SIDH arithmetic
• Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
• Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
• Look-up table-based large finite field multiplication in memory constrained cryptosystems
• scientific article; zbMATH DE number 1424173 (Why is no real title available?)
• Fast hardware architectures for supersingular isogeny Diffie-Hellman key exchange on FPGA
• scientific article; zbMATH DE number 7274000 (Why is no real title available?)
• On fast calculation of addition chains for isogeny-based cryptography
• Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography
• Exploring the solution space: CB-WCA for efficient finite field multiplication in post-quantum cryptography

Describes a project that uses

Uses Software

• gmp
• McEliece

This page was built for publication: Efficient finite field multiplication for isogeny based post quantum cryptography

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