Sciweavers

137
Voted
ARITH
1993
IEEE
15 years 11 months ago
On digit-recurrence division implementations for field programmable gate arrays
Marianne E. Louie, Milos D. Ercegovac
182
Voted
ARITH
1993
IEEE
15 years 11 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
164
Voted
ARITH
1993
IEEE
15 years 11 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
15 years 11 months ago
Very high radix division with selection by rounding and prescaling
Milos D. Ercegovac, Tomás Lang, Paolo Montu...
119
Voted
ARITH
1993
IEEE
15 years 11 months ago
High-radix modular multiplication for cryptosystems
Peter Kornerup