F
Florian Mendel
Researcher at Infineon Technologies
Publications - 147
Citations - 3966
Florian Mendel is an academic researcher from Infineon Technologies. The author has contributed to research in topics: Hash function & Collision attack. The author has an hindex of 31, co-authored 147 publications receiving 3430 citations. Previous affiliations of Florian Mendel include Katholieke Universiteit Leuven & Graz University of Technology.
Papers
More filters
Journal ArticleDOI
The Rebound Attack and Subspace Distinguishers: Application to Whirlpool
TL;DR: In this paper, the rebound attack was introduced as a variant of differential cryptanalysis on hash functions and applied to the hash function Whirlpool, standardized by ISO/IEC.
Book ChapterDOI
Rasta: A Cipher with Low ANDdepth and Few ANDs per Bit
Christoph Dobraunig,Maria Eichlseder,Lorenzo Grassi,Virginie Lallemand,Gregor Leander,Eik List,Florian Mendel,Christian Rechberger +7 more
TL;DR: This paper proposes with Rastaa a design strategy for symmetric encryption that has ANDdepth d and at the same time only needs d ANDs per encrypted bit, and is to the best of the knowledge the first attempt that minimizes both metrics simultaneously.
Book ChapterDOI
Second-Order differential collisions for reduced SHA-256
TL;DR: This work introduces a new non-random property for hash/compression functions using the theory of higher order differentials and shows a second-order differential collision for the compression function of SHA-256 reduced to 47 out of 64 steps with practical complexity.
Book ChapterDOI
Statistical Fault Attacks on Nonce-Based Authenticated Encryption Schemes
TL;DR: This work states that when targeting authenticated encryption schemes, this is in practice usually precluded by the unique nonce required by most of these schemes.
Book ChapterDOI
Cryptanalysis of the GOST Hash Function
TL;DR: In this paper, the security of the GOST hash function was analyzed and the first collision attack was presented with a complexity of about 2105 evaluations of the compression function. Butler et al. improved the complexity of the attack to 2192.