Sciweavers

2157 search results - page 128 / 432
» Optimal Fast Hashing
Sort
View
WEA
2010
Springer
397views Algorithms» more  WEA 2010»
15 years 11 months ago
A New Combinational Logic Minimization Technique with Applications to Cryptology
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
Joan Boyar, René Peralta
CHES
2009
Springer
200views Cryptology» more  CHES 2009»
16 years 5 months ago
Accelerating AES with Vector Permute Instructions
We demonstrate new techniques to speed up the Rijndael (AES) block cipher using vector permute instructions. Because these techniques avoid data- and key-dependent branches and mem...
Mike Hamburg
VLDB
2007
ACM
161views Database» more  VLDB 2007»
16 years 4 months ago
Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
Feifei Li, Ke Yi, Marios Hadjieleftheriou, George ...
140
Voted
SOSP
2001
ACM
16 years 1 months ago
Wide-Area Cooperative Storage with CFS
The Cooperative File System (CFS) is a new peer-to-peer readonly storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storag...
Frank Dabek, M. Frans Kaashoek, David R. Karger, R...
GLOBECOM
2007
IEEE
15 years 11 months ago
A New Design of Bloom Filter for Packet Inspection Speedup
— Bloom filter is a space-efficient randomized data structure for group membership query. It is widely used in networking applications which involve the packet header/content i...
Yang Chen, Abhishek Kumar, Jun Xu