Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers

DOI10.1051/ITA/2015007MaRDI QIDQ3465633zbMATH OpenOpenAlexFDO

Authors Abdalhossein Rezai, Parviz Keshavarzi

Publication date 22 January 2016

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/2015007

zbMATH Keywords

modular exponentiationpublic-key cryptosystemmodular multiplicationcanonical recodinghigh-speed arithmetic

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 1946644
• An algorithm for modular exponentiation.
• scientific article; zbMATH DE number 1953319
• Stochastic Algorithms: Foundations and Applications
• Fast modular multi-exponentiation using modified complex arithmetic

Cited in

(4)

• scientific article; zbMATH DE number 1953319 (Why is no real title available?)
• scientific article; zbMATH DE number 1946644 (Why is no real title available?)
• An algorithm for modular exponentiation.
• Stochastic Algorithms: Foundations and Applications

This page was built for publication: Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers

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