Sciweavers

28 search results - page 2 / 6
» Cunningham numbers in modular arithmetic
Sort
View
ARITH
1997
IEEE
13 years 11 months ago
Theory and applications for a double-base number system
In this paper we present a rigorous theoretical analysis of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of t...
Vassil S. Dimitrov, Graham A. Jullien, William C. ...
ANTS
2010
Springer
263views Algorithms» more  ANTS 2010»
13 years 10 months ago
Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
John Voight
IJNSEC
2010
324views more  IJNSEC 2010»
13 years 2 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 7 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
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 7 months ago
Q-adic Transform revisited
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...
Jean-Guillaume Dumas