scispace - formally typeset
Book ChapterDOI

Multi-differential cryptanalysis on reduced DM-PRESENT-80: collisions and other differential properties

TLDR
The current paper studies differential properties of the compression function of reduced-round DM-PRESENT-80, which was proposed at CHES 2008 as a lightweight hash function with 64-bit digests and success lies in the detailed analysis of the data transition, where the internal state and message values are carefully chosen.
Abstract
The current paper studies differential properties of the compression function of reduced-round DM-PRESENT-80, which was proposed at CHES 2008 as a lightweight hash function with 64-bit digests. Our main result is a collision attack on 12 rounds with a complexity of 229.18 12-round DM-PRESENT computations. Then, the attack is extended to an 18-round distinguisher and an 12-round second preimage attack. In our analysis, the differential characteristic is satisfied by the start-from-the-middle approach. Our success lies in the detailed analysis of the data transition, where the internal state and message values are carefully chosen so that a differential characteristic for 5 rounds can be satisfied with complexity 1 on average. In order to reduce the attack complexity, we consider as many techniques as possible; multi-inbound technique, early aborting technique, precomputation of look-up tables, multi-differential characteristics.

read more

Citations
More filters
Book

Cryptographic hardware and embedded systems : CHES 2007 : 9th International Workshop, Vienna, Austria, September 10-13, 2007 : proceedings

TL;DR: Two New Techniques of Side-Channel Cryptanalysis and Problems and Solutions for Lightweight Devices on the Implementation of a Fast Prime Generation Algorithm are presented.
Book

Cryptographic hardware and embedded systems : CHES 2008 : 10th International Workshop, Washington, D.C., USA, August 10-13, 2008 : proceedings

TL;DR: This paper presents a meta-analysis of the literature on side-channel attacks of RSA, a real-world attack Breaking A5/1 within hours, and some of the approaches used to solve these problems.
Book ChapterDOI

Known-Key Distinguisher on Full PRESENT

TL;DR: This article proposes a known-key distinguisher on the full PRESENT, both 80- and 128-bit key versions, and stresses that this is the very first attack that can reach the full number of rounds of the PRESENT block cipher.
Journal Article

Finding SHA-1 Characteristics: General Results and Applications

TL;DR: In this paper, a two-block collision for 64-step SHA-1 based on a new characteristic is presented, and the expected work factor of a collision search and the needed degrees of freedom for the search are discussed.
Journal ArticleDOI

Truncated differential based known-key attacks on round-reduced SIMON

TL;DR: The first known-key attack on round-reduced SIMON block cipher was proposed in this article, which is a bit-oriented block cipher with a Feistel structure.
References
More filters
Book

Handbook of Applied Cryptography

TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Book ChapterDOI

PRESENT: An Ultra-Lightweight Block Cipher

TL;DR: An ultra-lightweight block cipher, present, which is competitive with today's leading compact stream ciphers and suitable for extremely constrained environments such as RFID tags and sensor networks.
Journal Article

PRESENT: An Ultra-Lightweight Block Cipher

TL;DR: In this paper, the authors describe an ultra-lightweight block cipher, present, which is suitable for extremely constrained environments such as RFID tags and sensor networks, but it is not suitable for very large networks such as sensor networks.
Book

Fast Software Encryption

TL;DR: Simplified variants that omit a quadratic function and a fixed rotation in RC6 are examined to clarify their essential contribution to the overall security of RC6.
Book ChapterDOI

Polynomial reconstruction based cryptography

TL;DR: A short overview of recent works on the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) and the novel applications that were enabled due to this development.
Related Papers (5)