Concept

Table de hachage

Publications associées (72)

STM in the Small: Trading Generality for Performance in Software Transactional Memory

Data structures implemented using software transactional memory (STM) have a reputation for being much slower than data structures implemented directly from low-level primitives such as atomic compare-and-swap (CAS). In this paper we present a specialized ...

2012

Concurrent Tries with Efficient Non-Blocking Snapshots

Martin Odersky, Aleksandar Prokopec

We describe a non-blocking concurrent hash trie based on shared-memory single-word compare-and-swap instructions. The hash trie supports standard mutable lock-free operations such as insertion, removal, lookup and their conditional variants. To ensure spac ...

Assoc Computing Machinery2012

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski

Binary descriptors allow faster similarity computation than real-valued ones while requiring much less storage. As a result, many algorithms have recently been proposed to binarize ﬂoating-point descriptors so that they can be searched for quickly. Unfortu ...

Elsevier2012

Efficient Hashing Using the AES Instruction Set

Joppe Willem Bos, Martijn Stam, Onur Özen

In this work, we provide a software benchmark for a large range of 256-bit blockcipher-based hash functions. We instantiate the underlying blockcipher with AES, which allows us to exploit the recent AES instruction set (AESNI). Since AES itself only output ...

Springer Berlin Heidelberg2011

Grassmann Hashing For Approximate Nearest Neighbor Search In High Dimensional Space

Lei Zhang, Xinchao Wang

Locality-Sensitive Hashing (LSH) approximates nearest neighbors in high dimensions by projecting original data into low-dimensional subspaces. The basic idea is to hash data samples to ensure that the probability of collision is much higher for samples tha ...

Ieee2011

Cache-Aware Lock-Free Concurrent Hash Tries

Martin Odersky, Aleksandar Prokopec

This report describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and-swap instructions. Insert, lookup and remove operations modifying different parts of the hash trie can be run independent of each ...

2011

Neutrality-Based Symmetric Cryptanalysis

Shahram Khazaei

Cryptographic primitives are the basic components of any cryptographic tool. Block ciphers, stream ciphers and hash functions are the fundamental primitives of symmetric cryptography. In symmetric cryptography, the communicating parties perform essentially ...

EPFL2010

ARMADILLO: A Multi-purpose Cryptographic Primitive Dedicated to Hardware

Serge Vaudenay, Stéphane Badel, Pouyan Sepehrdad, Nilay Dagtekin, Khaled Ouafi, Jorge Nakahara, Petr Susil

This paper describes and analyzes the security of a general-purpose cryptographic function design, with application in RFID tags and sensor networks. Based on these analyzes, we suggest minimum parameter values for the main components of this cryptographic ...

Springer2010

Attacking the Knudsen-Preneel Compression Functions

Martijn Stam, Onur Özen

Knudsen and Preneel (Asiacrypt’96 and Crypto’97) introduced a hash function design in which a linear error-correcting code is used to build a wide-pipe compression function from underlying blockciphers operating in Davies-Meyer mode. In this paper, we (re) ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Roombots-Towards Decentralized Reconfiguration with Self-Reconfiguring Modular Robotic Metamodules

Auke Ijspeert, Mikaël Mayer, Alexander Spröwitz, Rico Möckel, Stéphane Bonardi, Pierre-André Mudry, Philippe Laprade

This paper presents our work towards a decentralized reconfiguration strategy for self-reconfiguring modular robots, assembling furniture-like structures from Roombots metamodules. We explore how reconfiguration by locomotion from a configuration A to a co ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search