Concept

Universal hashing

Related publications (23)

Learning Image Descriptors with Boosting

Vincent Lepetit, Tomasz Piotr Trzcinski, Christos Marios Christoudias

We propose a novel and general framework to learn compact but highly discriminative floating-point and binary local feature descriptors. By leveraging the boosting-trick we first show how to efficiently train a compact floating-point descriptor that is ver ...

Institute of Electrical and Electronics Engineers2015

Boosting Binary Keypoint Descriptors

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski, Christos Marios Christoudias

Binary keypoint descriptors provide an efficient alternative to their floating-point competitors as they enable faster processing while requiring less memory. In this paper, we propose a novel framework to learn an extremely compact binary descriptor we ca ...

2013

Recursive Diffusion Layers for Block Ciphers and Hash Functions

Pouyan Sepehrdad

Many modern block ciphers use maximum distance separable (MDS) matrices as the main part of their diffusion layers. In this paper, we propose a new class of diffusion layers constructed from several rounds of Feistel-like structures whose round functions a ...

Springer2012

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

Faster Software Cryptography

Dag Arne Osvik

This thesis presents work on the efficiency and security of cryptographic software. First it describes several efforts to construct very efficient implementations of cryptographic primitives. These include the Advanced Encryption Standard (AES) as well as ...

EPFL2012

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

Cryptographic Hash Functions in Groups and Provable Properties

Juraj Sarinay

We consider several "provably secure" hash functions that compute simple sums in a well chosen group (G,*). Security properties of such functions provably translate in a natural way to computational problems in G that are simple to define and possibly also ...

EPFL2011

Practical unconditionally secure two-channel message authentication

Atefeh Mashatan

We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. (Two-channel cryptography employs a broadband, insecure wireless channel and an authenticated, narrow-band manual channel at the sa ...

2010

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

Another Glance at Double-Length Hashing

Martijn Stam, Onur Özen

We propose a novel framework for blockcipher-based double-length hash functions by extending the recent generalization presented by Stam at FSE '09 for single-call hash functions. We focus on compression functions compressing 3n bits to 2n bits that use on ...

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