Near-Collisions for the Reduced Round Versions of Some Second Round SHA-3 Compression Functions Using Hill Climbing

Date

2010-12-15

Author

Turan, Meltem Soenmez
Uyan, Erdener

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

54
views

0
downloads

A hash function is near-collision resistant, if it is hard to find two messages with hash values that differ in only a small number of bits. In this study, we use hill climbing methods to evaluate the near-collision resistance of some of the second round SHA-3 candidates. We practically obtained (i) 184/256-bit near-collision for the 2-round compression function of Blake-32; (ii) 192/256-bit near-collision for the 2-round compression function of Hamsi-256; (iii) 820/1024-bit near-collisions for 10-round compression function of JH. Among the 130 possible reduced variants of Fugue-256, we practically observed collisions for 7 variants (e.g. (k, r, t) = (1, 2,5)) and near-collisions for 26 variants (e.g. 234/256 bit near-collision for (k, r, t) = (2,1,8)).

Subject Keywords

Hash functions, Near-collisions, SHA-3 Competition

URI

https://hdl.handle.net/11511/65262

Conference Name

11th International Conference on Cryptology in India

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Statistical analysis of block ciphers and hash functions Sulak, Fatih; Doğanaksoy, Ali; Department of Cryptography (2011) One of the most basic properties expected from block ciphers and hash functions is passing statistical randomness testing, as they are supposed to behave like random mappings. Previously, testing of AES candidate block ciphers was done by using the statistical tests defined in the NIST Test Suite. As some of the tests in this suite require long sequences, data sets are formed by concatenating the outputs of the algorithms obtained from various input types. However, the nature of block cipher and hash functi...
Infinite length hash chains and their applications Bicakci, K; Baykal, Nazife (2002-06-12) Hash Chains are used extensively in various cryptography, applications such as one-time passwords, server-supported signatures and micropayments. In this paper, we present a method, called Infinite Length Hash Chains to improve the flexibility of this chaining idea by using public-key techniques. One of its distinguishing features is that communication and computation overhead of restarting of the system is avoided. For the owner of the chain it is possible to go in either way in the chain at any time witho...
Some Studies on CCZ-Equivalence of the Inverse Function Fidan, Mehtap; ÖZBUDAK, Ferruh; Department of Cryptography (2021-9-28) Most cryptographic systems, like block ciphers, depend heavily on vectorial Boolean functions. A function with good cryptological properties should have low differential uniformity which is invariant under some equivalence classes. The more general one of these is CCZ-equivalence which is introduced by Carlet, Charpin and Zinoviev in 1998. In cryptography, CCZ-equivalence gained an interest since it preserves many significant properties like differential uniformity. Looking for permutations within the CCZ-c...
Hyperspectral Image Classification via Basic Thresholding Classifier Toksoz, Mehmet Altan; Ulusoy, İlkay (2016-07-01) We propose a lightweight sparsity-based algorithm, namely, the basic thresholding classifier (BTC), for hyperspectral image (HSI) classification. BTC is a pixelwise classifier which uses only the spectral features of a given test pixel. It performs the classification using a predetermined dictionary consisting of labeled training pixels. It then produces the class label and residual vector of the test pixel. Since incorporating spatial and spectral information in HSI classification is quite an effective way...
A Parallel GPU Implementation of SWIFFTX Ulu, Metin Evrim; Cenk, Murat (2020-01-01) The SWIFFTX algorithm is one of the candidates of SHA-3 Hash Competition that uses the number theoretic transform (NTT). It has 256-byte input blocks and 65-byte output blocks. In this paper, a parallel implementation of the algorithm and particular techniques to make it faster on GPU are proposed. We target version 6.1 of NVIDIA®CUDA™compute architecture that employs an ISA (Instruction Set Architecture) called Parallel Thread Execution (PTX) which possesses special instrinsics, hence we modify the referen...

Citation Formats

M. S. Turan and E. Uyan, “Near-Collisions for the Reduced Round Versions of Some Second Round SHA-3 Compression Functions Using Hill Climbing,” Hyderabad, India, 2010, vol. 6498, p. 131, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65262.