Fast modular multi-exponentiation using modified complex arithmetic

DOI10.1016/J.AMC.2006.08.051MaRDI QIDQ884549zbMATH OpenOpenAlexFDO

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

Publication date 6 June 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.08.051

zbMATH Keywords

public key cryptographyHamming weightmulti-exponentiationcomplex arithmeticsigned-digit recoding

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Parallel computation of the multi-exponentiation for cryptosystems
• Fast exponentiation by folding the signed-digit exponent in half
• scientific article; zbMATH DE number 1445807
• New modular multiplication algorithms for fast modular exponentiation
• Parallel algorithms for modular multi-exponentiation

Cites work

• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 1445807 (Why is no real title available?)
• scientific article; zbMATH DE number 2230910 (Why is no real title available?)
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• Carry propagation in signed digit representations
• Complexity and fast algorithms for multiexponentiations
• Computer arithmetic algorithms.
• Fast exponentiation by folding the signed-digit exponent in half
• Modular Multiplication Without Trial Division
• Multi-exponentiation (cryptographic protocols)
• New directions in cryptography
• Optimal left-to-right binary signed-digit recoding
• Parallel computation of the multi-exponentiation for cryptosystems
• Three hardware architectures for the binary modular exponentiation: sequential, parallel, and systolic

Cited in

(16)

• SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM
• Fast exponentiation by folding the signed-digit exponent in half
• A low-complexity LUT-based squaring algorithm
• Fast modular multiplication based on complement representation and canonical recoding
• Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers
• Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• scientific article; zbMATH DE number 5991592 (Why is no real title available?)
• Topics in Cryptology – CT-RSA 2004
• Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements
• Stochastic Algorithms: Foundations and Applications
• Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm
• Fast batch modular exponentiation with common-multiplicand multiplication
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• An algorithm for modular exponentiation.
• Accelerating oblivious transfer with batch multi-exponentiation

This page was built for publication: Fast modular multi-exponentiation using modified complex arithmetic

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