1945 search results - page 71 / 389 » Speeding up Serpent |
ASPDAC
2000
ACM
15 years 2 months ago
2000
ACM
We propose an efficient hardware architecture for the Blowfish algorithm [1]. The speed is up to 4 bit/clock, which is 9 times faster than a Pentium. By applying operator-reschedul...
BNCOD
2001
15 years 18 days ago
2001
Abstract. Integrating, cleaning and analyzing data from heterogeneous sources is often complicated by the large amounts of data and its physical distribution which can result in po...
IJCAI
2001
15 years 18 days ago
2001
We present an empirical analysis of optimization techniques devised to speed up the so-called TBox classification supported by description logic systems which have to deal with ve...
AAECC
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...