Conference ProceedingsOPEN ACCESS

A fast modular arithmetic algorithm using a residue table: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 330 LNCS 245-250
DOI: 10.1007/3-540-45961-8_21
12Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposes a fast modular arithmetic which can reduce the table size. It also implies the reduction of pre-computation time.

Cite

CITATION STYLE

APA

Kawamura, S. ichi, & Hirano, K. (1988). A fast modular arithmetic algorithm using a residue table: Extended abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 330 LNCS, pp. 245–250). Springer Verlag. https://doi.org/10.1007/3-540-45961-8_21

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