Minimum weight modified signed-digit representations and fast exponentiation

DOI10.1049/el:19890785zbMath0709.94699OpenAlexW1987658091MaRDI QIDQ3495290

Jonathan Jedwab, Chris J. Mitchell

Publication date: 1989

Published in: Electronics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1049/el:19890785

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Related Items (13)

Speeding up the computations of elliptic curves cryptoschemes ⋮ Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography ⋮ Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ Redundant integer representations and fast exponentiation ⋮ Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases ⋮ Parallel algorithms for power circuits and the word problem of the Baumslag group ⋮ Signed digit data hiding scheme ⋮ Non-minimality of the width-$w$ non-adjacent form in conjunction with trace one $\tau $-adic digit expansions and Koblitz curves in characteristic two ⋮ A low-complexity LUT-based squaring algorithm ⋮ Analysis of alternative digit sets for nonadjacent representations ⋮ Public-key cryptography on smart cards ⋮ Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation ⋮ Efficient algorithms for speeding up the computations of elliptic curve cryptosystems

This page was built for publication: Minimum weight modified signed-digit representations and fast exponentiation