We study the frequency of the positive integers n that are products of two primes of the same order of magnitude and such that the congruence Π i = 1 k p i f i (n) ≡ 1 (mod n) holds with some fixed nonzero polynomials f 1 (X), ..., f k (X) Z [ X ], where p i denotes the i th prime. The question is motivated by collision finding in the so-called Very Smooth Hash function, introduced by Contini et al. (Lecture notes in computer science, vol. 4004. Springer, Berlin, pp 165-182, 2006).
|Number of pages||8|
|Journal||Applicable Algebra in Engineering, Communications and Computing|
|Publication status||Published - Jun 2014|
- Hash function
- Multiplicative relations