A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.

DOI10.1016/S0020-0190(98)00031-3MaRDI QIDQ2583543zbMATH OpenFDO

Authors Jae-Cheol Ha, Sangjae Moon

Publication date 17 January 2006

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

Full work available at URL https://doi.org/10.1016/S0020-0190(98)00031-3

zbMATH Keywords

Common-multiplicand multiplicationCryptographyFast exponentiationModular arithmeticPublic key cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• scientific article; zbMATH DE number 2230910
• A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Fast batch modular exponentiation with common-multiplicand multiplication
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• scientific article; zbMATH DE number 177038 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Modular Multiplication Without Trial Division

Cited in

(10)

• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Fast batch modular exponentiation with common-multiplicand multiplication
• A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Linear systolic multiplier/squarer for fast exponentiation
• Fast modular multiplication based on complement representation and canonical recoding
• Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
• scientific article; zbMATH DE number 2230910 (Why is no real title available?)
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
• Fast modular multi-exponentiation using modified complex arithmetic
• Improved batch exponentiation

This page was built for publication: A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.

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