Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

SHA-1

Publications associées (16)

Orthros: A Low-Latency PRF

Subhadeep Banik

We present Orthros, a 128-bit block pseudorandom function. It is designed with primary focus on latency of fully unrolled circuits. For this purpose, we adopt a parallel structure comprising two keyed permutations. The round function of each permutation is ...

2021

Breaking The FF3 Format-Preserving Encryption Standard Over Small Domains

Serge Vaudenay, Fatma Betül Durak

The National Institute of Standards and Technology (NIST) recently published a Format-Preserving Encryption standard accepting two Feistel structure based schemes called FF1 and FF3. Particularly, FF3 is a tweakable block cipher based on an 8-round Feistel ...

2017

OMD: A Compression Function Mode of Operation for Authenticated Encryption

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We propose the Offset Merkle-Damgård (OMD) scheme, a mode of operation to use a compression function for building a nonce-based authenticated encryption with associated data. In OMD, the parts responsible for privacy and authenticity are tightly coupled to ...

Springer International Publishing2014

Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in $\mathbb{F}_{2^{4 \cdot 1223}}$ and $\mathbb{F}_{2^{12 \cdot 367}}$)

Thorsten Kleinjung, Robert Granger, Jens Markus Zumbrägel

In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and Thomé. U ...

Springer Berlin Heidelberg2014

Secure Computing with the MPEG RVC Framework

Marco Mattavelli, Richard Thavot, Junaid Jameel Ahmad

Recently, ISO/IEC standardized a dataflow-programming framework called Reconfigurable Video Coding (RVC) for the specification of video codecs. The RVC framework aims at providing the specification of a system at a high abstraction level so that the functi ...

Elsevier Science Bv2013

Design and Analysis of Multi-Block-Length Hash Functions

Onur Özen

Cryptographic hash functions are used in many cryptographic applications, and the design of provably secure hash functions (relative to various security notions) is an active area of research. Most of the currently existing hash functions use the Merkle-Da ...

EPFL2012

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

Synthetic Linear Analysis: Improved Attacks on CubeHash and Rabbit

Serge Vaudenay, Yi Lu

It has been considered most important and difficult to analyze the bias and find a large bias regarding the security of crypto-systems, since the invention of linear cryptanalysis. The demonstration of a large bias will usually imply that the target crypto ...

Springer2012

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

Performance Analysis of the SHA-3 Candidates on Exotic Multi-core Architectures

Joppe Willem Bos

The NIST hash function competition to design a new cryptographic hash standard 'SHA-3' is currently one of the hot topics in cryptologic research, its outcome heavily depends on the public evaluation of the remaining 14 candidates. There have been several ...

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

Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate

Arjen Lenstra, Dag Arne Osvik

We present a refined chosen-prefix collision construction for MD5 that allowed creation of a rogue Certification Authority (CA) certificate, based on a collision with a regular end-user website certificate provided by a commercial CA. Compared to the previ ...

Springer Verlag2009

On degraded two-message set broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P ⊆U . Transmissions occur over linear deterministic channels. For the case wher ...

2009

Multi-Stream Hashing on the PlayStation 3

Joppe Willem Bos, Dag Arne Osvik

With process technology providing more and more transistors per chip, still following Moore's \law", processor designers have used a number of techniques to make those transistors useful. Lately they have started placing multiple processor cores on each ch ...

Springer2008

Chosen-prefix collisions for MD5 and colliding X.509 certificates for different identities

Arjen Lenstra

We present a novel, automated way to find differential paths for MD5. As an application we have shown how, at an approximate expected cost of 2 50 calls to the MD5 compression function, for any two chosen message prefixes P and P′, suffixe ...

2007

Hash-and-Sign with Weak Hashing Made Secure

Serge Vaudenay, Sylvain Pasini

Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a weak hash function by a random oracle together with another oracle allowing to break s ...

Springer2007