Parallel modular multiplication with table look-up

DOI10.1080/00207169808804708zbMATH Open0901.68084OpenAlexW1991844986MaRDI QIDQ4208596FDOQ4208596

Ted C. Yang, Che Wun Chiou

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)

Cites Work

• A Computer Algorithm for Calculating the Product AB Modulo M

Cited In (5)

• Implementing multiplication with split read-only memory
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• 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

   Recommendations

• Parallel algorithms for modular multi-exponentiation 👍 👎
• Fast parallel modular exponentiation 👍 👎
• Fast Parallel Arithmetic via Modular Representation 👍 👎
• Title not available (Why is that?) 👍 👎
• Parallel Processing and Applied Mathematics 👍 👎
• Title not available (Why is that?) 👍 👎
• A fast parallel modular exponentiation algorithm 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Parallel modular exponentiation using load balancing without precomputation 👍 👎

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)