Parallel modular multiplication with table look-up

DOI10.1080/00207169808804708MaRDI QIDQ4208596zbMATH OpenOpenAlexFDO

Authors Che Wun Chiou, Ted C. Yang

Publication date 26 November 1998

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

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

zbMATH Keywords

number-theoretic cryptosystems

Mathematics Subject Classification ID

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

Recommendations

• Parallel algorithms for modular multi-exponentiation
• Fast parallel modular exponentiation
• Fast Parallel Arithmetic via Modular Representation
• scientific article; zbMATH DE number 1946644
• Parallel Processing and Applied Mathematics
• Publication:4206296
• A fast parallel modular exponentiation algorithm
• scientific article; zbMATH DE number 1445807
• scientific article; zbMATH DE number 2188494
• Parallel modular exponentiation using load balancing without precomputation

Cites work

• A Computer Algorithm for Calculating the Product AB Modulo M

Cited in

(9)

• A low-complexity LUT-based squaring algorithm
• Montgomery multiplication using vector instructions
• Implementing multiplication with split read-only memory
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• New modular multiplication algorithms for fast modular exponentiation
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Tabular minimal redundant modular structures for fast and high-precision computations using general-purpose computers
• Theoretical and methodological bases of modular technology of parallel tabular computations using universal processors
• New iterative algorithms for modular multiplication

This page was built for publication: Parallel modular multiplication with table look-up

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