#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1955

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ewan Fleischmann, Michael Gorski, Stefan Lucks
- IACR Cryptology ePrint Archive
- 2009

We provide the first proof of security for Tandem-DM, one of the oldest and most well-known constructions for turning a block cipher with n-bit block length and 2n-bit key length into a 2n-bit cryptographic hash function. We prove, that when Tandem-DM is instantiated with AES-256, block length 128 bits and key length 256 bits, any adversary that asks less… (More)

- Ewan Fleischmann, Michael Gorski, Stefan Lucks
- IACR Cryptology ePrint Archive
- 2009

We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit key length into a 2n-bit cryptographic hash function. In particular, we prove that when Abreast-DM is instantiated with AES-256, i.e. a block cipher with 128-bit block length and 256-bit key… (More)

- Michael Gorski, Stefan Lucks, Thomas Peyrin
- ASIACRYPT
- 2008

This paper studies the application of slide attacks to hash functions. Slide attacks have mostly been used for block cipher cryptanalysis. But, as shown in the current paper, they also form a potential threat for hash functions, namely for sponge-function like structures. As it turns out, certain constructions for hash-function-based MACs can be vulnerable… (More)

- Michael Gorski, Stefan Lucks
- IACR Cryptology ePrint Archive
- 2008

- Ewan Fleischmann, Michael Gorski, Stefan Lucks
- IACR Cryptology ePrint Archive
- 2009

ARIA [4] is a block cipher proposed at ICISC’03. Its design is very similar to the advanced encryption standard (AES). The authors propose that on 32-bit processors, the encryption speed is at least 70% of that of the AES. They claim to offer a higher security level than AES. In this paper we present two attacks of reduced round ARIA which shows some… (More)

- Orr Dunkelman, Ewan Fleischmann, Michael Gorski, Stefan Lucks
- INDOCRYPT
- 2009

In this paper we investigate the security of the compression function of HAS-160 in encryption mode. The structure of HAS-160 is similar to SHA-1 besides some modifications.This is the first cryptographic attack that breaks the encryption mode of the full 80-round HAS-160. We apply a key recovery attack that requires 2 chosen plaintexts and 2 80-round… (More)

- Ewan Fleischmann, Christian Forler, Michael Gorski, Stefan Lucks
- INDOCRYPT
- 2010

- Ewan Fleischmann, Michael Gorski, Stefan Lucks
- ISPEC
- 2009

- Ewan Fleischmann, Christian Forler, Michael Gorski
- IACR Cryptology ePrint Archive
- 2008

In this note we give an overview on the current state of the SHA-3 candidates. First, we classify all publicly known candidates and, second, we outline and summarize the performance data as given in the candidates documentation for 64-bit and 32-bit implementations. We define performance classes and classify the hash algorithms. Note, that this article will… (More)

- Ewan Fleischmann, Michael Gorski, Stefan Lucks
- IACR Cryptology ePrint Archive
- 2010

At Crypto 2005, Coron et al. introduced a formalism to study the presence or absence of structural flaws in iterated hash functions: If one cannot differentiate a hash function using ideal primitives from a random oracle, it is considered structurally sound, while the ability to differentiate it from a random oracle indicates a structural weakness. This… (More)