FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2017
01219962017

Related topics

Related topics

25 relations
Average-case complexityBirthday attackBitwise operationComputational complexity theory
(More)

Related mentions per year

Related mentions per year

1942-2018
19401960198020002020
Security of cryptographic hash functions
Computational complexity theory
Cryptography
Fast Fourier transform
Knapsack problem
Discrete logarithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Provable Security of Cryptographic Hash Functions (Bewijsbare veiligheid van cryptografische hashfuncties) ; Provable Security of Cryptographic Hash Functions
 
Is this relevant?
Highly Cited
2011
Highly Cited
2011
XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with… (More)
  • figure 1
  • table 1
Is this relevant?
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… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2004
2004
Cryptanalysis of a Provably Secure Cryptographic Hash Function
We present a cryptanalysis of a provably secure cryptographic hash function proposed by Augot, Finiasz and Sendrier in [1]. Our… (More)
Is this relevant?
2003
2003
A Fast Provably Secure Cryptographic Hash Function
We propose a family of fast and provably secure cryptographic hash functions. The security of these functions relies directly on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
True Random Number Generators Secure in a Changing Environment
A true random number generator (TRNG) usually consists of two components: an “unpredictable” source with high entropy, and a… (More)
  • table 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Provably Secure Blind Signature Schemes
In this paper, we give a provably secure design for blind signatures, the most important ingredient for anonymity in off-line… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?