Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication

DOI10.1007/978-3-642-00468-1_25zbMath1227.94054OpenAlexW2133956949MaRDI QIDQ3615631

Patrick Longa, Catherine H. Gebotys

Publication date: 24 March 2009

Published in: Public Key Cryptography – PKC 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00468-1_25

zbMATH Keywords

scalar multiplicationelliptic curve cryptosystemdouble base number systemfractional windowmultibase non-adjacent form

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Analysis on Yu et al.'s dynamic algorithm for canonic DBC, Using \(5\)-isogenies to quintuple points on elliptic curves, О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат, Оптимизация объема памяти при мультискалярном умножении, Double-base chains for scalar multiplications on elliptic curves, Jacobi Quartic Curves Revisited, Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited

Uses Software

• EFD