USING STEGANOGRAPHY TO IMPROVE HASH FUNCTIONS’ COLLISION RESISTANCE

Recently, many efficient cryptographic hash function design strategies have been explored, not least because of the SHA-3 competition. These designs are, almost exclusively, geared towards high performance on long inputs. However, various applications exist where the performance on short (fixed length) inputs matters more. Such hash functions are the bottleneck in hash-based signature schemes like SPHINCS or XMSS, which is currently under standardization. Secure functions specifically designed for such applications are scarce. We attend to this gap by proposing two short-input hash functions (or rather simply compression functions). By utilizing AES instructions on modern CPUs, our proposals are the fastest on such platforms, reaching throughputs below one cycle per hashed byte even for short inputs, while still having a very low latency of less than 60 cycles. Under the hood, this results comes with several innovations. First, we study whether the number of rounds for our hash functions can be reduced, if only second-preimage resistance (and not collision resistance) is required. The conclusion is: only a little. Second, since their inception, AES-like designs allow for supportive security arguments by means of counting and bounding the number of active S-boxes. However, this ignores powerful attack vectors using truncated differentials, including the powerful rebound attacks. We develop a general tool-based method to include arguments against attack vectors using truncated differentials.

Download Full-text

Collision Resistance of Hash Functions in a Weak Ideal Cipher Model

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e95.a.252 ◽

2012 ◽

Vol E95-A (1) ◽

pp. 252-255 ◽

Cited By ~ 4

Author(s):

Shoichi HIROSE ◽

Hidenori KUWAKADO

Keyword(s):

Hash Functions ◽

Collision Resistance ◽

Ideal Cipher ◽

Ideal Cipher Model

Download Full-text

On chosen target forced prefix preimage resistance

Tatra Mountains Mathematical Publications ◽

10.2478/v10127-010-0034-5 ◽

2010 ◽

Vol 47 (1) ◽

pp. 115-135 ◽

Cited By ~ 1

Author(s):

Michal Rjaško

Keyword(s):

Hash Function ◽

Hash Functions ◽

Formal Definition ◽

Collision Resistance ◽

Preimage Resistance ◽

The Family ◽

Lecture Notes ◽

Definition Of ◽

Cryptographic Techniques ◽

Security Notion

Abstract In this paper we analyze the Chosen Target Forced Prefix (CTFP) preimage resistance security notion for hash functions firstly introduced in [Kelsey, J.-Kohno, T.: Herding hash functions and the Nostradamus attack, in: Advances in Cryptology-EUROCRYPT ’06, 25th Annual Internat. Conf. on the Theory and Appl. of Cryptographic Techniques (S. Vaudenay, ed.), St. Peters- burg, Russia, 2006, Lecture Notes in Comput. Sci., Vol. 4004, Springer-Verlag, Berlin, 2006, pp. 183-200]. We give a formal definition of this property in hash function family settings and work out all the implications and separations be- tween the CTFP preimage resistance and other standard notions of hash function security (preimage resistance, collision resistance, etc.). This paper follows the work of [Rogaway, P.-Shrimpton, T.: Cryptographic hash-function basics: Def- initions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance, in: Fast Software Encryption, 11th Interna- tional Workshop-FSE ’04 (B. Roy et al., eds.), Delhi, India, 2004, Lecture Notes in Comput. Sci., Vol. 3017, Springer-Verlag, Berlin, 2004, pp. 371-388], where they define seven basic notions of hash function security and examine all the relationships among these notions. We also define a new property for security of hash function families-always CTFP preimage resistance, which guarantees CTFP security for all the hash functions in the family.

Download Full-text

Multi-collision resistance: a paradigm for keyless hash functions

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188870 ◽

2018 ◽

Cited By ~ 16

Author(s):

Nir Bitansky ◽

Yael Tauman Kalai ◽

Omer Paneth

Keyword(s):

Hash Functions ◽

Collision Resistance

Download Full-text

Performance and Security Tradeoffs in Cryptographic Hash Functions

International Journal of Interdisciplinary Telecommunications and Networking ◽

10.4018/ijitn.2020100103 ◽

2020 ◽

Vol 12 (4) ◽

pp. 37-51

Author(s):

Sultan Almuhammadi ◽

Omar Mohammed Bawazeer

Keyword(s):

Sensitivity Analysis ◽

Mobile Devices ◽

Digital Signature ◽

Hash Function ◽

Hash Functions ◽

Paper Study ◽

Computational Power ◽

Collision Resistance ◽

Block Sizes ◽

Cryptographic Hash Functions

A cryptographic hash function is an important component used in many applications, such as blockchain, authentication, data integrity, and digital signature. With the rapid increase in usage of mobile devices, more attention goes towards the tradeoffs between performance and security of cryptographic hash functions on mobile devices due to their limited computational power. The researchers in this paper study the most common cryptographic hash functions and highlights the tradeoffs between their performance and security. The hash functions considered in this study are MD4, MD5, Whirlpool, and the hash functions in the SHA family. The security of these hash functions is compared based on recent attacks in terms of collision resistance, preimage attacks, and sensitivity analysis. While the performance is tested on different input block sizes, useful observations and recommendations are made based on the results of this study.

Download Full-text