On the security of tiger hash function

Download
index.pdf
2008
Özen, Onur
Show full item record
240
views
51
downloads
Recent years have witnessed several real threats to the most widely used hash functions which are generally inspired from MD4, such as MD5, RIPEMD, SHA0 and SHA1. These extraordinary developments in cryptanalysis of hash functions brought the attention of the cryptology researchers to the alternative designs. Tiger is an important type of alternative hash functions and is proved to be secure so far as there is no known collision attack on the full (24 rounds) Tiger. It is designed by Biham and Anderson in 1995 to be very fast on modern computers. In two years some weaknesses have been found for Tiger-hash function. First, in FSE 006 Kelsey and Lucks found a collision for 16-17 rounds of Tiger and a pseudo-near-collision for 20 rounds. Then, Mendel et al extended this attack to find 19-round collision and 22-round pseudo-near-collision. Finally in 2007, Mendel and Rijmen found a pseudo-near-collision for the full Tiger. In this work, we modify the attack of Kelsey and Lucks slightly and present the exact values of the differences used in the attack. Moreover, there have been several cryptanalysis papers investigating the randomness properties of the designed hash functions under the encryption modes. In these papers, related-key boomerang and related-key rectangle attacks are performed on MD4,MD5, HAVAL and SHA. In this thesis, we introduce our 17,19 and 21-round related-key boomerang and rectangle distinguishers to the encryption mode of Tiger.
Electronic Computers., Computer Science.
http://etd.lib.metu.edu.tr/upload/12609117/index.pdf
https://hdl.handle.net/11511/17378
Graduate School of Applied Mathematics, Thesis

Suggestions

Design and implementation of a secure and searchable audit logging system
İncebacak, Davut; Çetin, Yasemin; Department of Information Systems (2007)
Logs are append-only time-stamped records to represent events in computers or network devices. Today, in many real-world networking applications, logging is a central service however it is a big challenge to satisfy the conflicting requirements when the security of log records is of concern. On one hand, being kept on mostly untrusted hosts, the logs should be preserved against unauthorized modifications and privacy breaches. On the other, serving as the primary evidence for digital crimes, logs are often n...
On the efficiency of authentication protocols, digital signatures and their applications in e-health: a top-down approach
Bıçakçı, Kemal; Baykal, Nazife; Department of Information Systems (2003)
Choosing an authentication protocol or a digital signature algorithm becomes more challenging when performance constraints are of concern. In this thesis, we discuss the possible options in a top-down approach and propose viable alternatives for the efficiency criteria. Before all the technical discussions, argue that identifying prerequisites, threats and risks on an organizational conthas utmost importance so that effective solutions can be delivered at a reasonable cost. For instance, one approach to sol...
Scalar multiplication on elliptic curves
Yayla, Oğuz; Akyıldız, Ersan; Department of Cryptography (2006)
Elliptic curve cryptography has gained much popularity in the past decade and has been challenging the dominant RSA/DSA systems today. This is mainly due to elliptic curves offer cryptographic systems with higher speed, less memory and smaller key sizes than older ones. Among the various arithmetic operations required in implementing public key cryptographic algorithms based on elliptic curves, the elliptic curve scalar multiplication has probably received the maximum attention from the research community i...
Efficient scheduling in distributed computing on grid
Kaya, Özgür; Bozyiğit, Müslim; Department of Computer Engineering (2006)
Today many computing resources distributed geographically are idle much of time. The aim of the grid computing is collecting these resources into a single system. It helps to solve problems that are too complex for a single PC. Scheduling plays a critical role in the efficient and effective management of resources to achieve high performance on grid computing environment. Due to the heterogeneity and highly dynamic nature of grid, developing scheduling algorithms for grid computing involves some challenges....
Performance analysis of reliable multicast protocols
Çelik, Coşkun; Bazlamaçcı, Cüneyt Fehmi; Department of Electrical and Electronics Engineering (2004)
IP multicasting is a method for transmitting the same information to multiple receivers over IP networks. Reliability issue of multicasting contains the challenges for detection and recovery of packet losses and ordered delivery of the entire data. In this work, existing reliable multicast protocols are classified into three main groups, namely tree based, NACK-only and router assisted, and a representative protocol for each group is selected to demonstrate the advantages and disadvantages of the correspond...
Citation Formats
O. Özen, “On the security of tiger hash function,” M.S. - Master of Science, Middle East Technical University, 2008.
METU IIS - Integrated Information Service open@metu.edu.tr