1170 search results - page 17 / 234 » How Fast Is Too Fast |
94
Voted
ARITH
1993
IEEE
15 years 5 months ago
1993
IEEE
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...
CHES
2007
Springer
15 years 7 months ago
2007
Springer
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
121
Voted
DAMON
2007
Springer
15 years 7 months ago
2007
Springer
In 1987, Gray and Putzolo presented the five-minute rule, which was reviewed and renewed ten years later in 1997. With the advent of flash memory in the gap between traditional RA...
126
click to vote
VALUETOOLS
2006
ACM
15 years 6 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
106
Voted
FSE
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper discusses the state-of-the-art software optimization methodology for symmetric cryptographic primitives on Pentium III and 4 processors. We aim at maximizing s...