C5
2007
IEEE
15 years 21 days ago
2007
IEEE
C5
2007
IEEE
15 years 21 days ago
2007
IEEE
3D virtual environments like Croquet need to be attractive in order to be visited and used. Their attractiveness depends on the level of vitality that the user is able to experien...
ARITH
2007
IEEE
15 years 21 days ago
2007
IEEE
Most implementations of the modular exponentiation, ME mod N, computation in cryptographic algorithms employ Montgomery multiplication, ABR−1 mod N, instead of modular multiplic...
ARITH
2007
IEEE
15 years 21 days ago
2007
IEEE
ARITH
2007
IEEE
15 years 21 days ago
2007
IEEE
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the di...
ARITH
2007
IEEE
15 years 21 days ago
2007
IEEE
The compensated Horner algorithm improves the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic: the computed result is as accurate as if it was computed wi...
ARITH
2007
IEEE
15 years 21 days ago
2007
IEEE
Abstract— Floating-point arithmetic is notoriously nonassociative due to the limited precision representation which demands intermediate values be rounded to fit in the availabl...
ARITH
2007
IEEE
15 years 21 days ago
2007
IEEE
The floating-point multiply-add fused (MAF) unit sets a new trend in the processor design to speed up floatingpoint performance in scientific and multimedia applications. This ...
ARITH
2007
IEEE
15 years 21 days ago
2007
IEEE
This paper describes a new basis for the implementation of a shifter functional unit. We present a design based on the inverse butterfly and butterfly datapath circuits that perfo...
ARITH
2007
IEEE
15 years 21 days ago
2007
IEEE
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...