Contributions to cryptanalysis : design and analysis of cryptographic hash functions / by Przemysław Szczepan Sokołowski Sokołowski, Przemysław Szczepan

User activity

Share to:
View the summary of this work
Author
Sokołowski, Przemysław Szczepan
Subjects
Cryptography.; Thesis PhD.; Hash functions
Audience
Specialized
Summary
"A thesis submitted to Macquarie University for the degree of Doctor of Philosophy, Department of Computing, Faculty of Science". "August 2012" Includes bibliographical references. 1. Introduction -- 2. Cryptographic hash functions -- 3. Open key differential analysis for block ciphers -- 4. IDEA in various hashing modes -- 5. Analysis of addition-rotation-XOR designs -- 6. Conclusions -- A. Proofs of rotational analysis lemmas -- B. mCrypton. "A cryptographic hash function is a mechanism producing a fixed-length output of a message of arbitrary length. It fullfils a collection of security requirements guaranteeing that a hash function does not introduce any weakness into the system to which it is applied. The example applications of cryptographic hash functions include digital signatures and message authentication codes. This thesis analyzes cryptographic hash functions and studies the design principles in the construction of secure cryptographic hash functions. We investigate the problem of building hash functions from block ciphers and the security properties of different structures used to design compression functions. We show that we can build open-key differential distinguishers for Crypton, Hierocrypt-3, SAFER++ and Square. We know that our attack on SAFER++ is the first rebound attack with standard differentials. To demonstrate the efficiency of proposed distinguishers, we provide formal proof of a lower bound for finding a differential pair that follows a truncated differential in the case of a random permutation. Our analysis shows that block ciphers used as the underlying primitive should also be analyzed in the open-key model to prevent possible collision attacks. We analyze the IDEA-based hash functions in a variety of cipher modes. We present practical complexity collision search attacks and preimage attacks, where we exploit a null weak-key and a new non-trivial property of IDEA. We prove that even if a cipher is considered secure in the secret-key model, one has to be very careful when using it as a building block in the hashing modes. Finally, we investigate the recent rotational analysis. We show how to extend the rotational analysis to subtractions, shifts, bit-wise Boolean functions, multi additions and multi subtractions. In particular, we develop formulae for calculation of probabilities of preserving the rotation property for multiple modular additions and subtractions. We examine S-functions and its application to the rotational analysis. The findings are applied to BMW and SIMD. We also propose a new shift distinguisher and apply it to Shabal. Mode of access: World Wide Web. 1 online resource (xi, 137 pages)
Bookmark
http://trove.nla.gov.au/work/189960538
Work ID
189960538

2 editions of this work

Find a specific edition
Thumbnail [View as table] [View as grid] Title, Author, Edition Date Language Format Libraries

User activity


e.g. test cricket, Perth (WA), "Parkes, Henry"

Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.

Be the first to add a tag for this work

Be the first to add this to a list

Comments and reviews

What are comments? Add a comment

No user comments or reviews for this work

Add a comment


Show comments and reviews from Amazon users