Skip to main content
Journal ArticleOPEN ACCESS

Efficient parallel multiplication algorithm for large integers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2790 923-928
DOI: 10.1007/978-3-540-45209-6_127
6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new algorithm for calculating A*B is presented. It is based on precompilation of a small number of values that allow for an efficient parallel implementation of multiplication. The algorithm requires O(logn) time and O(n2/logn2) area with small constant factors which makes it feasible for practical implementations. © Springer - Verlag 2003.

Author supplied keywords

Cite

CITATION STYLE

APA

Bunimov, V., & Schimmler, M. (2004). Efficient parallel multiplication algorithm for large integers. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 923–928. https://doi.org/10.1007/978-3-540-45209-6_127

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free