New answers tagged

4

In randomized hashing for Merkle-Damgard based hash function (like MD5, SHA1, SHA2) the input preprocessed with a salt before hashing applied. This process doesn't modify the underlying hash function uses it as a black box, It is proposed by Shai Halevi and Hugo Krawczyk in 2007; Strengthening Digital Signatures via Randomized Hashing For MD based hash ...


0

This is basically something that is called a 3-XOR problem, and was studied for some time. In short, the best known time complexity is $2^{n/2}$ for $n$-bit hash. However, naive approach requires lots of memory, and there are methods to reduce the memory complexity (sometimes at the cost of more time). For details see recent work [1], slides are also ...


2

My guess is that the intention is to make an RSA-1536 (or Rabin) signature of name (as a string) and integer $i$ per Full Domain Hash. Thus I answer, form a crypto standpoint, a rephrasing of the question as: How do I make a full-domain hash of the concatenation of a name (given as a string) and an integer, towards signing these per RSA-FDH. In a nutshell, ...


Top 50 recent answers are included