Sciweavers

22 search results - page 3 / 5
» arith 1999
Sort
View
ARITH
1999
IEEE
13 years 10 months ago
Moduli for Testing Implementations of the RSA Cryptosystem
Comprehensive testing of any implementation of the RSA cryptosystem requires the use of a number of moduli with specific properties. It is shown how to generate a sufficient varie...
Colin D. Walter
ARITH
1999
IEEE
13 years 10 months ago
Digit-Recurrence Algorithm for Computing Euclidean Norm of a 3-D Vector
A digit-recurrence algorithm for computing the Euclidean norm of a 3-dimensional vector is proposed. Starting from the vector component with the highest order of magnitude as the ...
Naofumi Takagi, Seiji Kuwahara
ARITH
1999
IEEE
13 years 10 months ago
Multiplications of Floating Point Expansions
In modern computers, the floating point unit is the part of the processor delivering the highest computing power and getting most attention from the design team. Performance of an...
Marc Daumas
ARITH
1999
IEEE
13 years 10 months ago
Floating-Point Unit in Standard Cell Design with 116 Bit Wide Dataflow
The floating-point unit of a S/390 CMOS microprocessor is described. It contains a 116 bit fraction dataflow for addition and subtraction and a 64 bit-wide multiplier. Besides the...
Guenter Gerwig, Michael Kroener
ARITH
1999
IEEE
13 years 10 months ago
New Algorithms for Improved Transcendental Functions on IA-64
The IA-64 architecture provides new opportunities and challenges for implementing an improved set of transcendental functions. Using several novel polynomial-based table-driven te...
Shane Story, Ping Tak Peter Tang