Redundant integer representations and fast exponentiation

DOI10.1007/BF00125080zbMath0852.94016OpenAlexW2081847638MaRDI QIDQ1910428

Chris J. Mitchell, Yongfei Han, Dieter Gollmann

Publication date: 12 December 1996

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

complexitystring replacementcryptographic algorithmsimplementation of modular exponentiation of large integerssigned-digit representationssquare-and-multiply exponentiation algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (1)

Minimal weight k-SR representations

Cites Work

• Unnamed Item
• Unnamed Item
• Adaptive \(m\)-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers
• An improved binary algorithm for RSA
• Modular Multiplication Without Trial Division
• Minimum weight modified signed-digit representations and fast exponentiation
• High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
• High-radix and bit recoding techniques for modular exponentiation
• A method for obtaining digital signatures and public-key cryptosystems
• A SIGNED BINARY MULTIPLICATION TECHNIQUE

This page was built for publication: Redundant integer representations and fast exponentiation