scispace - formally typeset
Open AccessPosted Content

Cryptanalysis of the Hash Function LUX-256.

TLDR
This paper found some non-random properties of LUX due to the weakness of origin shift vector and gives reduced blank round collision attack, free-start collision attack and free- start preimage attack on LUX-256.
Abstract
LUX is a new hash function submitted to NIST’s SHA-3 competition. In this paper, we found some non-random properties of LUX due to the weakness of origin shift vector. We also give reduced blank round collision attack, free-start collision attack and free-start preimage attack on LUX-256. The two collision attacks are trivial. The freestart preimage attack has complexity of about 2 and requires negligible memory.

read more

Content maybe subject to copyright    Report

Citations
More filters
Dissertation

Design and Analysis of Opaque Signatures

TL;DR: This study study the relationship between two security properties important for public key encryption, namely data privacy and key privacy, and concludes that the popular generic constructions of confirmer signatures necessitate strong security assumptions on the building blocks, which impacts negatively the efficiency of the resulting signatures.
References
More filters
Book ChapterDOI

Fast Hashing and Stream Encryption with PANAMA

TL;DR: A cryptographic module that can be used both as a cryptographic hash function and as a stream cipher, achieving high performance through a combination of low work-factor and a high degree of parallelism is presented.
Book ChapterDOI

The Grindahl hash functions

TL;DR: The Grindahl hash functions, which are based on components of the Rijndael algorithm, are proposed with claimed security levels with respect to collision, preimage and second preimage attacks of 2128 and 2256, respectively.
Posted Content

Cryptanalysis of EnRUPT

TL;DR: A preimage attack on EnRUPT- 512 is presented, exploiting the fact that the internal state is only a little bit larger than the critical security level: 1152 bits against 1024 bits to allow a shortcut meet-in-the-middle attack.