Open AccessDissertation
Generic Attacks on Hash Functions
Reads0
Chats0
TLDR
This thesis reviews the analysis done by Kelsey and Kohno of CTFP resistance and proposes a correction of their analysis and a revised analysis that calculates the message complexity and the computational complexity of the generic attacks that are based on the diamond structure.Abstract:
The subject of this thesis is a security property of hash functions, called chosen-targetforced-prefix preimage (CTFP) resistance and the generic attack on this property, called the herding attack. The study of CTFP resistance started when Kelsey-Kohno introduced a new data structure, called a diamond structure, in order to show the strength of a CTFP resistance property of a hash function. In this thesis, we concentrate on the complexity of the diamond structure and its application in the herding attack. We review the analysis done by Kelsey and Kohno and point out a subtle flaw in their analysis. We propose a correction of their analysis and based on our revised analysis, calculate the message complexity and the computational complexity of the generic attacks that are based on the diamond structure. As an application of the diamond structure on generic attacks, we propose a multiple herding attack on a special generalization of iterated hash functions, proposed by Nandi-Stinson.read more
Citations
More filters
An Efficient Existentially Unforgeable signature Scheme and its Applications
Cynthia Dwork,Moni Naor +1 more
TL;DR: This work presents an existentially unforgeable signature scheme that for a reasonable setting of parameters requires at most six times the amount of time needed to generate a signature using ``plain'' RSA (which is not existentially forgivable).
Journal Article
Breaking the ICE : Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
Jonathan J. Hoch,Adi Shamir +1 more
TL;DR: In this paper, the authors consider the general case and prove that even if each iterated hash function can scan the input multiple times in an arbitrary expanded order, their concatenation is not stronger than a single function.
Posted Content
Some Cryptanalytic Results on Zipper Hash and Concatenated Hash.
Ashwin Jha,Mridul Nandi +1 more
TL;DR: In this article, Chen and Jin showed a forced-suffix herding attack on the zipper hash and Chen et al. showed (second) preimage, and herding attacks on an n-bit zipper hash with f 1 = f 2, all of which require less than 2 n online computations.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
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.