Sciweavers

ARITH
1993
IEEE
13 years 9 months ago
Faster numerical algorithms via exception handling
An attractive paradigm for building fast numerical algorithms is the following: 1 try a fast but occasionally unstable algorithm, 2 test the accuracy of the computed answer, a...
James Demmel, Xiaoye S. Li
ARITH
1993
IEEE
13 years 9 months ago
Fast implementations of RSA cryptography
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...
Mark Shand, Jean Vuillemin
ARITH
1993
IEEE
13 years 9 months ago
Very high radix division with selection by rounding and prescaling
Milos D. Ercegovac, Tomás Lang, Paolo Montu...