Sciweavers

Share
ASIACRYPT
2011
Springer
7 years 7 months ago
Biclique Cryptanalysis of the Full AES
Since Rijndael was chosen as the Advanced Encryption Standard, improving upon 7-round attacks on the 128-bit key variant or upon 8-round attacks on the 192/256-bit key variants has...
Andrey Bogdanov, Dmitry Khovratovich, Christian Re...
CANS
2010
Springer
197views Cryptology» more  CANS 2010»
8 years 5 months ago
Near-Collisions on the Reduced-Round Compression Functions of Skein and BLAKE
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, ...
Bozhan Su, Wenling Wu, Shuang Wu, Le Dong
CAI
2007
Springer
8 years 7 months ago
On High-Rate Cryptographic Compression Functions
Abstract. The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphe...
Richard Ostertág, Martin Stanek
IEICET
2008
93views more  IEICET 2008»
8 years 7 months ago
Compression Functions Suitable for the Multi-Property-Preserving Transform
Since Bellare and Ristenpart showed a multi-property preserving domain extension transform, the problem of the construction for multi-property hash functions has been reduced to th...
Hidenori Kuwakado, Masakatu Morii
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
8 years 8 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...
CRYPTO
2008
Springer
70views Cryptology» more  CRYPTO 2008»
8 years 9 months ago
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
We propose a family of compression functions built from fixed-key blockciphers and investigate their collision and preimage security in the ideal-cipher model. The constructions ha...
Phillip Rogaway, John P. Steinberger
CRYPTO
1997
Springer
156views Cryptology» more  CRYPTO 1997»
8 years 11 months ago
Fast and Secure Hashing Based on Codes
This paper considers hash functions based on block ciphers. It presents a new attack on the compression function of the 128-bit hash function MDC-4 using DES with a complexity far ...
Lars R. Knudsen, Bart Preneel
FSE
2005
Springer
117views Cryptology» more  FSE 2005»
9 years 22 days ago
Security Analysis of a 2/3-Rate Double Length Compression Function in the Black-Box Model
Abstract. In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the com...
Mridul Nandi, Wonil Lee, Kouichi Sakurai, Sangjin ...
CISC
2007
Springer
111views Cryptology» more  CISC 2007»
9 years 1 months ago
Multivariates Polynomials for Hashing
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...
Jintai Ding, Bo-Yin Yang
books