Comparing with RSA

A multi-set (ms) is a set where an element can occur more than once. ms hash functions (mshfs) map mss of arbitrary cardinality to fixed-length strings. This paper introduces a new rsa-based mshf. The new function is efficient and produces small hashes. We prove that the proposed mshf is collision-resistant under the assumption of unforgeability of deterministic rsa signatures. In many practical applications, programmers need to compare two (unordered) sets of integers. A trivial solution consists in sorting both sets (O(n log n)) and comparing them linearly. We show how ms hash functions can be turned into a linear-time, constant-space integer set equality test.

• Type: Conference
• Year: 2009
• Where: IMA
• Authors: Julien Cathalo, David Naccache, Jean-Jacques Quisquater
• Keywords: Arbitrary Cardinality, Cryptography, Deterministic Rsa Signatures, IMA 2009, Ms Hash Functions