High-radix and bit recoding techniques for modular exponentiation

DOI10.1080/00207169108804009zbMath0742.68018OpenAlexW2076621334MaRDI QIDQ3991119

Çetin Kaya Koç

Publication date: 28 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108804009

zbMATH Keywords

modular exponentiationRSA cryptosystembinary method\(m\)-ary methodbit recoding

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Analysis of sliding window techniques for exponentiation ⋮ Redundant integer representations and fast exponentiation ⋮ Subtraction-free almost Montgomery inverse algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An 0(n) Parallel Multiplier with Bit-Sequential Input and Output
• A method for obtaining digital signatures and public-key cryptosystems
• A SIGNED BINARY MULTIPLICATION TECHNIQUE

This page was built for publication: High-radix and bit recoding techniques for modular exponentiation