Skip to search formSkip to main contentSkip to account menu

Security of cryptographic hash functions

Known as: Provably secure cryptographic hash function, Provably secure hash function 
In cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
Average-case complexityBirthday attackBitwise operationComputational complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Improved Indifferentiability Security Bound for the Prefix-Free Merkle-Damgård Hash Function
The indifferentiability framework has been tailored to evaluate the security of cryptographic hash functions such that an… 
2017
2017
Short Solutions to Nonlinear Systems of Equations
This paper presents a new hard problem for use in cryptography, called Short Solutions to Nonlinear Equations (SSNE). This… 
Review
2017
Review
2017
Design and analysis of cryptographic algorithms
In today’s world computers are ubiquitous. They can be found in virtually any industry and most households own at least one… 
2011
2011
Towards efficient lattice-based cryptography
One essential quest in cryptography is the search for hard instances of a given computational problem that is known to be hard in… 
2009
2009
Template Protection via Piecewise Hashing
When biometric recognition is used for identification or verification it is important to assure the privacy of the data subject… 
2009
2009
Hardware Implementations of a Variant of the Zémor-Tillich Hash Function: Can a Provably Secure Hash Function be very efficient ?
Hash functions are widely used in Cryptography, and hardware implementations of hash functions are of interest in a variety of… 
Review
2009
Review
2009
Cryptographic hash functions based on ALife
There is a long history of cryptographic hash functions, i.e. functions mapping variable-length strings to fixed-length strings… 
2009
2009
A Note on the Security of Cryptographic Hash Functions
2008
2008
Efficiency and pseudo-randomness of a variant of Zémor-Tillich hash function
Recent breakthroughs concerning the current standard SHA-1 prompted NIST to launch a competition for a new secure hash algorithm… 
2007
2007
On the Performance of Provably Secure Hashing with Elliptic Curves
Summary We propose a cryptographic hash function based on the difficulty of computing discrete logarithms in the group of points… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)