scientific article; zbMATH DE number 2230910

MaRDI QIDQ5708977zbMATH OpenFDO

Authors Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang

Publication date 21 November 2005

zbMATH Keywords

modular exponentiationMontgomery reduction algorithmpublic-key cryptosystems

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
• Fast algorithms for implemention of Montgomery's modular multiplication technique
• An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
• scientific article; zbMATH DE number 1057744
• Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
• scientific article; zbMATH DE number 1024029
• An RNS Montgomery modular multiplication algorithm
• An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm

Cited in

(13)

• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• A fast parallel modular exponentiation algorithm
• Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements
• 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
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
• Fast exponentiation by folding the signed-digit exponent in half
• scientific article; zbMATH DE number 1882024 (Why is no real title available?)
• Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques
• An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
• scientific article; zbMATH DE number 2188494 (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

This page was built for publication:

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