Proofs of Useless Work -- Positive and Negative Results for Wasteless Mining Systems [PDF]
Many blockchain systems today, including Bitcoin, rely on Proof of Work (PoW). Proof of work is crucial to the liveness and security of cryptocurrencies. The assumption when using PoW is that a lot of trial and error is required on average before a valid block is generated.
arxiv
A Secure Hash Function MD-192 With Modified Message Expansion [PDF]
Cryptographic hash functions play a central role in cryptography. Hash functions were introduced in cryptology to provide message integrity and authentication. MD5, SHA1 and RIPEMD are among the most commonly used message digest algorithm. Recently proposed attacks on well known and widely used hash functions motivate a design of new stronger hash ...
arxiv
Merkle Trees in Blockchain: A Study of Collision Probability and Security Implications [PDF]
In the rapidly evolving landscape of blockchain technology, ensuring the integrity and security of data is paramount. This study delves into the security aspects of Merkle Trees, a fundamental component in blockchain architectures, such as Ethereum. We critically examine the susceptibility of Merkle Trees to hash collisions, a potential vulnerability ...
arxiv +1 more source
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1 [PDF]
Kazumaro Aoki, Yu Sasaki
openalex +1 more source
Herding, Second Preimage and Trojan Message Attacks beyond Merkle-Damgård [PDF]
Elena Andreeva+3 more
openalex +1 more source
Computing preimages of points and curves under polynomial maps [PDF]
In this paper, we give two algorithms to compute preimages of curves under polynomial endomorphisms. In particular, this gives an efficient way of computing preimages of points. Furthermore, we explain the abstract setting under which one can iteratively compute the inverse of a polynomial automorphism.
arxiv
Second Preimage Attack on 3-Pass HAVAL and Partial Key-Recovery Attacks on HMAC/NMAC-3-Pass HAVAL [PDF]
Eun‐Jin Lee+4 more
openalex +1 more source
Sequences of preimages in elementary cellular automata [PDF]
We search for regularities in the sequences of numbers of preimages for elementary cellular automata. For 46 out of 88 "minimal" rules, we find recognizable patterns, usually in the form of second order recurrence equations with constant coefficients. Introducing the concept of asymptotic emulation of CA rules, we then show how the regularities in the ...
arxiv
Preimage Attacks on One-Block MD4, 63-Step MD5 and More [PDF]
Kazumaro Aoki, Yu Sasaki
openalex +1 more source
Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2 [PDF]
Jian Guo+3 more
openalex +1 more source