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

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.

zbMATH Keywords

cryptographydesign of algorithmsmodular exponentiationFibonacci number system

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Robust universal complete codes for transmission and compression
• Robust transmission of unbounded strings using Fibonacci representations
• A Survey of Fast Exponentiation Methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithm design: Foundations, analysis, and Internet examples

Cited In (2)

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

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)