Sciweavers

945 search results - page 92 / 189
» On the robustness of primitive words
Sort
View
CHES
2009
Springer
200views Cryptology» more  CHES 2009»
16 years 6 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
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
16 years 3 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro
PVM
2009
Springer
16 years 25 days ago
Hierarchical Collectives in MPICH2
Abstract. Most parallel systems on which MPI is used are now hierarchical: some processors are much closer to others in terms of interconnect performance. One of the most common su...
Hao Zhu, David Goodell, William Gropp, Rajeev Thak...
ECTEL
2007
Springer
16 years 14 days ago
Role Based Access Control for the Interaction with Search Engines
Search engine-based features are a basic interaction mean for users to find information inside a Web-based Learning Management Systems (LMS); nonetheless, traditional solutions la...
Alessandro Bozzon, Tereza Iofciu, Wolfgang Nejdl, ...
ASIACRYPT
2005
Springer
15 years 12 months ago
Spreading Alerts Quietly and the Subgroup Escape Problem
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
James Aspnes, Zoë Diamadi, Kristian Gjø...