Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography
From MaRDI portal
Publication:5267802
DOI10.1007/978-3-319-55227-9_14zbMath1409.94882OpenAlexW2605112356MaRDI QIDQ5267802
Frederik Vercauteren, Sujoy Sinha Roy, Ingrid Verbauwhede, Angshuman Karmakar
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
Cryptography (94A60) Mathematical problems of computer architecture (68M07) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
Fast Hardware Architectures for Supersingular Isogeny Diffie-Hellman Key Exchange on FPGA, An alternative approach for SIDH arithmetic
Uses Software
Cites Work
- Unnamed Item
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Cryptographic hash functions from expander graphs
- Claw finding algorithms using quantum walk
- Isogeny-Based Quantum-Resistant Undeniable Signatures
- Modular Multiplication Without Trial Division
- Rainbow, a New Multivariable Polynomial Signature Scheme
- The Arithmetic of Elliptic Curves
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Constructing elliptic curve isogenies in quantum subexponential time