Advances in Cryptology – CRYPTO 2004

DOI10.1007/B99099zbMath1104.94034DBLPconf/crypto/2004OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311563

Katsuyuki Okeya, Christian Spahn, Katja Schmidt-Samoa, Tsuyoshi Takagi

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99099

zbMATH Keywords

exponentiationefficient computationscalar multiplicationelliptic curve cryptosystemaddition-subtraction chainssigned binaryleft-to-rightmutual opposite form (MOF)non-adjacent form (NAF)

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (8)

Elliptic curve scalar multiplication algorithm using complementary recoding ⋮ Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods ⋮ Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm ⋮ Minimality and other properties of the width-𝑤 nonadjacent form ⋮ On optimal binary signed digit representations of integers ⋮ Fast simultaneous scalar multiplication ⋮ Unbalanced digit sets and the closest choice strategy for minimal weight integer representations ⋮ Fast elliptic curve point multiplication based on window non-adjacent form method

This page was built for publication: Advances in Cryptology – CRYPTO 2004