Minimum weight modified signed-digit representations and fast exponentiation

DOI10.1049/EL:19890785MaRDI QIDQ3495290zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495290)