Should one always use repeated squaring for modular exponentiation?

DOI10.1016/J.IPL.2007.11.016zbMATH Open1186.68544OpenAlexW2031092704MaRDI QIDQ963373FDOQ963373

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

Recommendations

• Redundant integer representations and fast exponentiation
• New modular multiplication algorithms for fast modular exponentiation
• Another look at some fast modular arithmetic methods
• scientific article; zbMATH DE number 2188494
• An algorithm for modular exponentiation.

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1200329 (Why is no real title available?)
• scientific article; zbMATH DE number 503339 (Why is no real title available?)
• scientific article; zbMATH DE number 793950 (Why is no real title available?)
• scientific article; zbMATH DE number 1406771 (Why is no real title available?)
• A Survey of Fast Exponentiation Methods
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Algorithm design: Foundations, analysis, and Internet examples
• Robust transmission of unbounded strings using Fibonacci representations
• Robust universal complete codes for transmission and compression

Cited in

(2)

• Guided blocks WOM codes
• Space-efficient and noise-robust quantum factoring

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

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