Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians
From MaRDI portal
Publication:2811789
DOI10.1090/conm/637/12753zbMath1365.11081arXiv1310.5250OpenAlexW1510719509MaRDI QIDQ2811789
No author found.
Publication date: 10 June 2016
Published in: Algorithmic Arithmetic, Geometry, and Coding Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.5250
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (4)
Ready-made short basis for GLV+GLS on high degree twisted curves ⋮ The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
This page was built for publication: Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians
