Sciweavers

128 search results - page 1 / 26
» Fast Integer Multiplication using Modular Arithmetic
Sort
View
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 4 months ago
Fast Integer Multiplication using Modular Arithmetic
We give an O(N
Anindya De, Piyush P. Kurur, Chandan Saha, Rampras...
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 4 months ago
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
ISCAS
2006
IEEE
102views Hardware» more  ISCAS 2006»
13 years 10 months ago
A fast dual-field modular arithmetic logic unit and its hardware implementation
— We propose a fast Modular Arithmetic Logic Unit (MALU) that is scalable in the digit size (d) and the field size (k). The datapath of MALU has chains of Carry Save Adders (CSA...
Kazuo Sakiyama, Bart Preneel, Ingrid Verbauwhede
ARITH
2005
IEEE
13 years 10 months ago
Arithmetic Operations in the Polynomial Modular Number System
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
Jean-Claude Bajard, Laurent Imbert, Thomas Plantar...
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 4 months ago
Compressed Modular Matrix Multiplication
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy