Analysis of linear combination algorithms in cryptography

DOI10.1145/1077464.1077473zbMath1321.68514OpenAlexW2029653748MaRDI QIDQ2944493

Clemens Heuberger, Prodinger, Helmut, Jörg M. Thuswaldner, Peter J. Grabner

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1077464.1077473

zbMATH Keywords

elliptic curveonline algorithmHamming weightdigital expansionscryptosystems

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Online algorithms; streaming algorithms (68W27)

Related Items (8)

Dynamical directions in numeration ⋮ Numeration and discrete dynamical systems ⋮ The Hamming weight of the non-adjacent-form under various input statistics ⋮ Minimal weight and colexicographically minimal integer representations ⋮ Unbalanced digit sets and the closest choice strategy for minimal weight integer representations ⋮ ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS ⋮ The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography ⋮ Variances and covariances in the central limit theorem for the output of a transducer

This page was built for publication: Analysis of linear combination algorithms in cryptography