902 search results - page 60 / 181 » R* Search |
132
click to vote
ACNS
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
126
click to vote
WEA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
100
click to vote
COMAD
2008
15 years 1 months ago
2008
This paper illustrates a strange property that was encountered when analysing keyword query data. The objective of this work was to observe the temporal properties of keyword quer...
MICRO
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper describes several methods for improving the scalability of memory disambiguation hardware for future high ILP processors. As the number of in-flight instructions grows...
107
click to vote
CEC
2010
IEEE
15 years 29 days ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...