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
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
Cryptography (94A60) Mathematical problems of computer architecture (68M07) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The Arithmetic of Elliptic Curves
- Modular Multiplication Without Trial Division
- Title not available (Why is that?)
- Cryptographic hash functions from expander graphs
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- 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
- Rainbow, a New Multivariable Polynomial Signature Scheme
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Claw finding algorithms using quantum walk
- Isogeny-based quantum-resistant undeniable signatures
Cited In (11)
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
- Fast hardware architectures for supersingular isogeny Diffie-Hellman key exchange on FPGA
- Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
- Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
- Finite field arithmetic in large characteristic for classical and post-quantum cryptography
- On fast calculation of addition chains for isogeny-based cryptography
- Title not available (Why is that?)
- Look-up table-based large finite field multiplication in memory constrained cryptosystems
- Title not available (Why is that?)
- An alternative approach for SIDH arithmetic
- Exploring the solution space: CB-WCA for efficient finite field multiplication in post-quantum cryptography
Uses Software
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)
