Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
From MaRDI portal
Publication:5404743
DOI10.1007/978-3-319-04852-9_1zbMath1294.94045OpenAlexW2226566141MaRDI QIDQ5404743
Armando Faz-Hernández, Patrick Longa, Ana Helena Sánchez
Publication date: 28 March 2014
Published in: Topics in Cryptology – CT-RSA 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04852-9_1
elliptic curvesscalar multiplicationGLV methodside-channel protectionGLS methodconstant-time computationARM processorGLV-GLS curveNEON instructionsx64 processor
Related Items (11)
A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA) ⋮ Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography ⋮ Jacobian coordinates on genus 2 curves ⋮ Montgomery Modular Multiplication on ARM-NEON Revisited ⋮ Twisted Hessian Curves ⋮ T_SM: Elliptic Curve Scalar Multiplication Algorithm Secure Against Single-Trace Attacks ⋮ Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors ⋮ An optimal representation for the trace zero subgroup ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions ⋮ Kummer for genus one over prime-order fields ⋮ Point compression for the trace zero subgroup over a small degree extension field
Uses Software
This page was built for publication: Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
