Should one always use repeated squaring for modular exponentiation?

DOI10.1016/j.ipl.2007.11.016zbMath1186.68544OpenAlexW2031092704MaRDI QIDQ963373

Shmuel T. Klein

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.11.016

zbMATH Keywords

cryptographydesign of algorithmsmodular exponentiationFibonacci number system

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (1)

Guided blocks WOM codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust universal complete codes for transmission and compression
• Robust transmission of unbounded strings using Fibonacci representations
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Survey of Fast Exponentiation Methods

This page was built for publication: Should one always use repeated squaring for modular exponentiation?