International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 30000 results
Parallelized hashing via j-lanes and j-pointers tree modes, with applications to SHA-256
Eprint
https://eprint.iacr.org/2014/170
Shay Gueron
The j-lanes tree hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. The j-pointers tree hashing is a similar tree...
received 3 Mar 2014
A j-lanes tree hashing mode and j-lanes SHA-256
Eprint
https://eprint.iacr.org/2012/476
Shay Gueron
j-lanes hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. We demonstrate the performance advantage of j-lanes...
last revised 21 Aug 2012
SHA-512/256
Eprint
https://eprint.iacr.org/2010/548
Shay Gueron Simon Johnson Jesse Walker
With the emergence of pervasive 64 bit computing we observe that it is more cost effective to compute a SHA-512 than it is to compute a SHA-256 over a given size of data. We propose a standard way to use SHA-512 and truncate...
last revised 18 Nov 2010
Parallelizing message schedules to accelerate the computations of hash functions
Eprint
https://eprint.iacr.org/2012/067
Shay Gueron Vlad Krasnov
This paper describes an algorithm for accelerating the computations of Davies-Meyer based hash functions. It is based on parallelizing the computation of several message schedules for several message blocks of a given message....
last revised 5 Jun 2012
Simultaneous hashing of multiple messages
Eprint
https://eprint.iacr.org/2012/371
Shay Gueron Vlad Krasnov
We describe a method for efficiently hashing multiple messages of different lengths. Such computations occur in various scenarios, and one of them is when an operating system checks the integrity of its components during boot...
last revised 3 Jul 2012
IACR FSE 2009
https://iacr.org/archive/fse2009/fse2009.html
FSE 2009: Orr Dunkelman (Ed.): Fast Software Encryption - FSE 2009, Leuven, Belgium, February 22--25, 2009 Proceedings. FSE 2009 Preface by Orr Dunkelman (Eds.): Organizational Committee Program Chairs : Orr Dunkelman General...
Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation
Eprint
https://eprint.iacr.org/2017/702
Shay Gueron Yehuda Lindell
Block cipher modes of operation provide a way to securely encrypt using a block cipher. The main factors in analyzing modes of operation are the level of security achieved (chosen-plaintext security, authenticated encryption,...
last revised 31 Aug 2017
Sufficient conditions for sound tree and sequential hashing modes
Eprint
https://eprint.iacr.org/2009/210
Guido Bertoni Joan Daemen Michael Peeters Gilles Van Assche
Hash functions are usually composed of a mode of operation on top of a concrete primitive with fixed input-length and fixed output-length, such as a block cipher or a permutation. In practice, the mode is often sequential,...
last revised 28 Jan 2014
Shay Gueron
Author
https://iacr.org/cryptodb/data/author.php?authorkey=737
Amazon Web Services and University of Haifa
Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=28472
Kevin Atighehchi Alexis Bonnecaze
Tosc 2017
Discussions about the choice of a tree hash mode of operation for a standardization have recently been undertaken. It appears that a single tree mode cannot address adequately all possible uses and specifications of a system....
Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3
Eprint
https://eprint.iacr.org/2016/658
Kevin Atighehchi Alexis Bonnecaze
Discussions about the choice of a tree hash mode of operation for a standardization have recently been undertaken. It appears that a single tree mode cannot address adequately all possible uses and specifications of a system....
last revised 19 Aug 2017
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=24042
Yevgeniy Dodis Leonid Reyzin Ronald L. Rivest Emily Shen
Fse 2009
Higher-Order Differential Attack on Reduced SHA-256
Eprint
https://eprint.iacr.org/2011/037
Mario Lamberger Florian Mendel
In this work, we study the application of higher-order differential attacks on hash functions. We show a second-order differential attack on the SHA-256 compression function reduced to 46 out of 64 steps. We implemented the...
received 20 Jan 2011
On Collisions of Hash Functions Turbo SHA-2
Eprint
https://eprint.iacr.org/2008/003
Vlastimil Klima
In this paper we don't examine security of Turbo SHA-2 completely; we only show new collision attacks on it, with smaller complexity than it was considered by Turbo SHA-2 authors. In [1] they consider Turbo SHA-224/256-r and...
received 1 Jan 2008
On the Security of Encryption Modes of MD4, MD5 and HAVAL
Eprint
https://eprint.iacr.org/2005/327
Jongsung Kim Alex Biryukov Bart Preneel Sangjin Lee
MD4 is a cryptographic hash function introduced in 1990 by Rivest. After MD4 was proposed, several hash functions such as MD5, HAVAL, RIPEMD, RIPEMD-160, SHA-1 and SHA-256 were designed based on the MD4 structure. In this...
last revised 14 Oct 2005
Non-Linear Reduced Round Attacks Against SHA-2 Hash family
Eprint
https://eprint.iacr.org/2008/174
Somitra Kumar Sanadhya Palash Sarkar
Most of the attacks against (reduced) SHA-2 family in literature have used local collisions which are valid for linearized version of SHA-2 hash functions. Recently, at FSE '08, an attack against reduced round SHA-256 was...
received 16 Apr 2008
Analysis of SHA-512/224 and SHA-512/256
Eprint
https://eprint.iacr.org/2016/374
Christoph Dobraunig Maria Eichlseder Florian Mendel
In 2012, NIST standardized SHA-512/224 and SHA-512/256, two truncated variants of SHA-512, in FIPS 180-4. These two hash functions are faster than SHA-224 and SHA-256 on 64-bit platforms, while maintaining the same hash size...
received 13 Apr 2016
Sakura: a flexible coding for tree hashing
Eprint
https://eprint.iacr.org/2013/231
Guido Bertoni Joan Daemen Michael Peeters Gilles Van Assche
We propose a flexible, fairly general, coding for tree hash modes. The coding does not define a tree hash mode, but instead specifies a way to format the message blocks and chaining values into inputs to the underlying...
last revised 18 Apr 2014
SPHINCS-Simpira: Fast Stateless Hash-based Signatures with Post-quantum Security
Eprint
https://eprint.iacr.org/2017/645
Shay Gueron Nicky Mouha
We introduce SPHINCS-Simpira, which is a variant of the SPHINCS signature scheme with Simpira as a building block. SPHINCS was proposed by Bernstein et al. at EUROCRYPT 2015 as a hash-based signature scheme with post-quantum...
received 29 Jun 2017
Attacking Reduced Round SHA-256
Eprint
https://eprint.iacr.org/2008/142
Somitra Kumar Sanadhya Palash Sarkar
The SHA-256 hash function has started getting attention recently by the cryptanalysis community due to the various weaknesses found in its predecessors such as MD4, MD5, SHA-0 and SHA-1. We make two contributions in this work....
last revised 15 May 2008
Next ►