Very smooth hash

All cryptographic hash functions that are now{{When|date=August 2024}} widely used are not based on hard mathematical problems. Those few functions that are constructed on hard mathematical problems are called provably secure. Finding collisions is then known to be as hard as solving the hard mathematical problem. For the basic version of Very Smooth Hash, this hard problem is to find modular square roots (VSSR) of certain special numbers (VSN). This is assumed to be as hard as factoring integers.

For fixed constants {{Mvar|c}} and {{Mvar|n}}, an integer {{Mvar|m}} is a Very Smooth Number (VSN) if the largest prime factor of {{Mvar|m}} is at most {{Math|log(n)^c}}.

An integer {{Mvar|b}} is a Very Smooth Quadratic Residue modulo {{Mvar|n}} if the largest prime in {{Mvar|b}}'s factorization is at most {{Math|log(n)^c}} and there exists an integer {{Mvar|x}} such that {{Math|b ≡ x² (mod n)}}. The integer {{Mvar|x}} is then said to be a modular square root of {{Mvar|b}}.

We are interested only in non-trivial square roots, those where {{Math|x² ≥ n}}. If {{Math|x² < n}}, then the root can be easily computed using algorithms from fields of characteristic 0, such as the real field. Therefore, they are not suitable in cryptographic primitives.

Very Smooth Number Nontrivial Modular Square Root (VSSR) is the following problem: Let {{Mvar|n}} be the product of two unknown primes of approximately the same size, let {{Math|k ≤ (log(n))^c}}, and let {{Math|1=(p₁,p₂,p₃,…) = (2,3,5,…)}} be the sequence of primes. Given {{Mvar|n}}, find an integer {{Mvar|x}} coprime to {{Mvar|n}} such that $\backslash textstyle\; x^2\; \backslash equiv\; \backslash prod\_\{i=0\}^k\; p\_i^\{e\_i\}\; \backslash pmod\{n\}$ and at least one of {{Math|e₀,…,e_k}} is odd.

The VSSR assumption is that there is no probabilistic polynomial (in {{Math|log(n)}}) time algorithm which solves VSSR with non-negligible probability. This is considered a useless assumption in practice because it does not tell for what size of moduli VSSR is computationally hard. Instead the computational VSSR assumption is used. It says that solving VSSR is assumed to be as hard as factoring a hard-to-factor {{Mvar|s}}-bit modulus, where {{Mvar|s}} is somewhat smaller than the size of {{Mvar|n}}.

Let the parameters be fixed as {{Math|1=c = 5}} and {{Math|1=n = 31}}.

Then {{Math|1=m₁ = 35 = 5 · 7}} is a Very Smooth Number with respect to these parameters because {{Math|log(31)⁵ ≈ 7.37}} is greater than all of {{Math|m₁}}'s prime factors. On the other hand, {{Math|1=m₂ = 55 = 5 · 11}} is not a VSN under these parameters.

The integer {{Math|9}} is a Very Smooth Quadratic Residue modulo {{Mvar|n}} because it is a Very Smooth Number (under {{Math|c,n}}), and {{Math|3² ≡ 9 (mod n)}}. This is a trivial modular square root, because {{Math|9 < n}} and so the modulus is not involved when squaring.

The integer $b\_2\; =\; 15$ is also Very Smooth Quadratic Residue modulo $n$. All prime factors are smaller than 7.37 and the Modular Square Root is $x\_2\; =\; 20$ since $20^2\; =\; 400\; \backslash equiv\; 15$ (mod $n$). This is thus a non-trivial root. The VSSR problem is to find $x\_2$ given $b\_2$ and $n$. And we suppose that this is computationally as hard as factoring $n$.

The integer {{Math|1=b = 15}} is also a Very Smooth Quadratic Residue modulo {{Mvar|n}}. All of its prime factors are smaller than 7.37, and the modular square root is {{Math|1=x = 20}}, since {{Math|1=20² = 400 ≡ 15 (mod n)}}. This is thus a non-trivial square root. The VSSR problem is to find {{Mvar|x}} given {{Mvar|b}} and {{Mvar|n}}. This is believed to be computationally as hard as factoring {{Mvar|n}}.

Let {{Mvar|n}} be a large RSA composite and let {{Math|1=(p₁,p₂,p₃,…) = (2,3,5,…)}} be the sequence of primes. Let {{Mvar|k}}, the block length, be the largest integer such that . Let {{Mvar|m}} be an {{Mvar|ℓ}}-bit message to be hashed consisting of bits {{Math|(m₁,…,m_ℓ)}} and assume that {{Math|ℓ < 2^k}}. To compute the hash of {{Mvar|m}}:

1. Set {{Math|1=x₀ = 1}}.
2. Let {{Mvar|L}}, the smallest integer greater than or equal to {{Math|ℓ/k}}, be the number of blocks.
3. Let {{Math|1=m_i = 0}} for {{Math|ℓ < i < Lk}} (padding).
4. Let $\backslash textstyle\; \backslash ell\; =\; \backslash sum\_\{i=1\}^k\; l\_i\; 2^\{i-1\}$ with {{Math|ℓ_i ∈ {{mset|0,1}}}} be the binary representation of the message length {{Mvar|ℓ}} and define {{Math|1=m_Lk+i = ℓ_i}} for {{Math|1 ≤ i ≤ k}}.
5. For {{Math|1=j = 0, 1, …, L}} in succession, compute $x\_\{j+1\}\; =\; x\_j^2\; \backslash prod\_\{i=1\}^k\; p\_i^\{m\_\{jk+i\}\}\backslash mod\; n$
6. Return {{Math|x_L+1}}.

The function in step 5 is called the compression function.

• The message length does not need to be known in advance.
• Finding a collision in VSH is as hard as solving VSSR. Thus VSH is (strongly) collision-resistant, which also implies second preimage resistance. VSH has not been proven to be preimage-resistant.
• The compression function is not collision-resistant. Nonetheless, the hash function VSH is collision-resistant based on the VSSR assumption. An altered version of VSH, called VSH*, uses a collision-resistant compression function and is about 5 times quicker when hashing short messages.
• Since the output length of VSH is the length of a secure RSA modulus, VSH seems quite suitable in practice for constructing "hash-then-sign" RSA signatures for arbitrarily long messages. However, such a signature must be designed carefully to ensure its security. The naïve approach could be easily broken under a chosen-plaintext attack.
• The cost of each iteration is less than the cost of 3 modular multiplications. The basic version of VSH altogether requires one multiplication per {{Math|Ω(log(n) / log(log(n)))}} message bits.

Several improvements, speedups, and more efficient variants of VSH have been proposed. None of them changes the underlying concept of the function. These improvements are called:

• Cubing VSH (instead of squaring)
• VSH with increased number of small primes
• VSH with precomputed products of primes
• Fast VSH
• Fast VSH with increased block length

The VSH-DL is a discrete logarithm variant of VSH that has no trapdoor; its security depends on the difficulty of finding discrete logarithms modulo a prime {{Mvar|p}}.

Very Smooth Number Discrete Logarithm (VSDL) is a problem where, given a very smooth number, the task is to find its discrete logarithm modulo some number {{Mvar|n}}.

As in previous section, {{Math|p_i}} denotes the {{Mvar|i}}th prime. Let furthermore {{Mvar|c}} be a fixed constant and {{Math|p,q}} be primes with {{Math|1=p = 2q + 1}} and let {{Math|k ≤ (log p)^c}}. VSDL is the following problem: given {{Mvar|p}}, find integers {{Math|e₁,…,e_k}} such that $2^\{e\_1\}\; \backslash equiv\; \backslash prod\_\{i=2\}^k\; p\_i^\{e\_i\}\; \backslash pmod\; p$ with {{Math|{{abs|e_i}} < q}} for {{Math|1=i = 1, …, k}} and at least one of {{Math|e₁,…,e_k}} is non-zero.

The VSDL assumption is that there is no probabilistic polynomial (in {{Math|log(p)}}) time algorithm which solves VSDL with non-negligible probability. There is a strong connection between the hardness of VSDL and the hardness of computing discrete logarithms modulo {{Mvar|p}}, which is reminiscent of, but somewhat weaker than, the connection between VSSR and integer factorization.

Strong collision resistance is the only property proven for VSH. This does not imply preimage-resistance or other important hash function properties, and the authors state that "VSH should not be used to model random oracles," and cannot be substituted into constructions that depend upon them (RSA signatures, some MACs). VSH should not be considered a general-purpose hash function as usually understood in security engineering.

VSH is multiplicative: Let {{Mvar|x}}, {{Mvar|y}}, and {{Mvar|z}} be three bitstrings of equal length, where {{Mvar|z}} consists only of zero bits and the strings satisfy {{Math|1=x AND y = z}}. Then {{Math|H(z)H(x OR y) ≡ H(x)H(y) (mod n)}}. As a result, VSH succumbs to a classical time-memory trade-off attack that applies to multiplicative and additive hashes.

This fact can be used to construct a preimage attack against VSH of {{Mvar|ℓ}} bits which has {{Math|2^ℓ/2}} complexity rather than {{Math|2^ℓ}} as expected.

VSH produces a very long hash (typically 1024 bits). There are no indications that a truncated VSH hash offers security that is commensurate with the hash length.

There exists a partial collision attack on VSH truncated to {{Mvar|ℓ}} least significant bits.{{Citation

| last1 = Saarinen

| first1 = M.-J. O.

| title = Progress in Cryptology - INDOCRYPT 2006

| chapter = Security of VSH in the real world

| series = Lecture Notes in Computer Science

| year = 2006

| volume = 4329

| pages = 95–103

| doi = 10.1007/11941378_8

| isbn = 978-3-540-49767-7

| chapter-url = http://www.tcs.hut.fi/~mjos/doc/saarinen_vsh.pdf

| url-status = }}{{deadlink|date=September 2023}}

The complexity of this attack against VSH is:

• Pre-computing the table offline: {{Math|2^ℓ/3}} time and space.
• Finding collisions: {{Math|2^ℓ/3}} iterations.
• Total cost: roughly {{Math|2^ℓ/3}}, rather than {{Math|2^ℓ/2}} as expected from a hash function with good pseudorandomness properties.

This probably{{According to whom|date=August 2024}} rules out the applicability of VSH in digital signature schemes which produce signatures shorter than the VSH hash result, such as elliptic-curve signature schemes.

• Cryptographic hash functions
• Provably secure cryptographic hash function

{{reflist}}

{{Cryptography navbox | hash}}

Category:Cryptographic hash functions