128 search results - page 22 / 26 » Fast Integer Multiplication using Modular Arithmetic |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
ISCAS
2007
IEEE
14 years 1 months ago
2007
IEEE
— Fast addition and multiplication are of paramount importance in many arithmetic circuits and processors. The use of redundant number system for efficient implementation of thes...
ARITH
1993
IEEE
13 years 11 months ago
1993
IEEE
We detail and analyse the critical techniques which may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd divisio...
CTRSA
2004
Springer
14 years 22 days ago
2004
Springer
This paper presents a scalable hardware implementation of both commonly used public key cryptosystems, RSA and Elliptic Curve Cryptosystem (ECC) on the same platform. The introduce...
IDMS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...