01whole.pdf (1.11 MB)
Download file

Contributions to cryptanalysis: design and analysis of cryptographic hash functions

Download (1.11 MB)
thesis
posted on 28.03.2022, 13:26 by Przemysław Szczepan Sokołowski
"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.

History

Table of Contents

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.

Notes

A thesis submitted to Macquarie University for the degree of Doctor of Philosophy, Department of Computing, Faculty of Science". Includes bibliographical references "August 2012

Awarding Institution

Macquarie University

Degree Type

Thesis PhD

Degree

PhD, Macquarie University, Faculty of Science, Department of Computing

Department, Centre or School

Department of Computing

Year of Award

2013

Principal Supervisor

Josef Pieprzyk

Additional Supervisor 1

Jerzy Jaworski

Additional Supervisor 2

Ron Steinfeld

Rights

Copyright disclaimer: http://www.copyright.mq.edu.au Copyright Przemysław Szczepan Sokołowski 2013

Language

English

Extent

1 online resource (xi, 137 pages)

Former Identifiers

mq:33486 http://hdl.handle.net/1959.14/307348 2128240