Parallel computation of the multi-exponentiation for cryptosystems

DOI10.1080/00207169708804548MaRDI QIDQ3123350zbMATH OpenOpenAlexFDO

Authors Chin-Chen Chang, Der-Chyuan Lou

Publication date 30 June 1997

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169708804548

zbMATH Keywords

cryptosystemsmodular multi-exponentiationfast modular exponentiation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1445807
• Parallel algorithms for modular multi-exponentiation
• scientific article; zbMATH DE number 1946644
• Fast modular multi-exponentiation using modified complex arithmetic

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 53193 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Computing Sequences with Addition Chains
• Multi-exponentiation (cryptographic protocols)
• New directions in cryptography
• On the Evaluation of Powers
• PARALLEL COMPUTATION OF THE MODULAR CASCADE EXPONENTIATION
• Parallel implementation of the rsa public-key cryptosystem
• Some properties of vectorial addition chains^†
• \(O(\log n)\) numerical algorithms on a mesh with wormhole routing

Cited in

(18)

• Binary addition chain on EREW PRAM
• SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM
• Fast exponentiation by folding the signed-digit exponent in half
• Fast modular multiplication based on complement representation and canonical recoding
• scientific article; zbMATH DE number 1445807 (Why is no real title available?)
• scientific article; zbMATH DE number 1983211 (Why is no real title available?)
• Public Key Cryptography - PKC 2005
• Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques
• A fast parallel modular exponentiation algorithm
• Parallel algorithms for modular multi-exponentiation
• A note on asynchronous multi-exponentiation algorithm using binary representation
• Fast modular multi-exponentiation using modified complex arithmetic
• Parallel computation for LUC cryptosystems on distributed memory multiprocessor machine
• Implementing Montgomery multiplication to speed-up the computation of modular exponentiation of multi-bit numbers
• Multi-exponentiation (cryptographic protocols)
• A Parallel and Uniform k-Partition Method for Montgomery Multiplication
• A method for computing Lucas sequences
• The complexity of certain multi-exponentiation techniques in cryptography

This page was built for publication: Parallel computation of the multi-exponentiation for cryptosystems

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