A practical parallel algorithm for computinga b modc *

DOI10.1007/BF02900867MaRDI QIDQ4229557zbMATH OpenFDO

Authors Dawei Dai, Jingwei Huang

Publication date 26 May 1999

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02900867

zbMATH Keywords

public key cryptosystemRNS representationsRSA cryptosystem

Mathematics Subject Classification ID

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

Recommendations

• A fast parallel modular exponentiation algorithm
• scientific article; zbMATH DE number 1946644
• Parallel algorithms for modular multi-exponentiation
• scientific article; zbMATH DE number 1445807
• Fast parallel modular exponentiation
• Publication:4206296
• scientific article; zbMATH DE number 2118995
• Highly parallel computations modulo a number having only small prime factors
• Fast Parallel Arithmetic via Modular Representation

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• New directions in cryptography

Cited in

(6)

• Highly parallel computations modulo a number having only small prime factors
• Modular exponentiation via the explicit Chinese remainder theorem
• Computing Powers in Parallel
• scientific article; zbMATH DE number 4128395 (Why is no real title available?)
• A Parallel and Uniform k-Partition Method for Montgomery Multiplication
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: A practical parallel algorithm for computinga b modc *

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