Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation

DOI10.1007/978-3-319-13051-4_20zbMath1382.94150OpenAlexW2197430430MaRDI QIDQ2798626

Julio López, Diego F. Aranha, Thomaz Oliveira, Francisco Rodríguez-Henríquez

Publication date: 13 April 2016

Published in: Selected Areas in Cryptography -- SAC 2014 (Search for Journal in Brave)

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

zbMATH Keywords

scalar multiplicationsoftware implementationbinary elliptic curves

Mathematics Subject Classification ID

Cryptography (94A60) Computational aspects of algebraic curves (14Q05)

Related Items (6)

Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves ⋮ A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA) ⋮ How to (pre-)compute a ladder -- improving the performance of X25519 and X448 ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions ⋮ Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited ⋮ Koblitz curves over quadratic fields

This page was built for publication: Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation