Skip to main content
Conference ProceedingsOPEN ACCESS

A library for parallel modular arithmetic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1685 LNCS 1476-1483
DOI: 10.1007/3-540-48311-x_210
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper describes a library of platform independent functions for performing modular arithmetic on a range of parallel hardware. It is based around an approximate Chinese remainder reconstruction which allows the most significant bits of the stored number to be calculated without the cost of a full reconstruction. We describe how this can be used to calculate the length of a modular number, and also its applications to comparison and division. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Power, D., & Bradford, R. (1999). A library for parallel modular arithmetic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 1476–1483). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_210

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