Welcome to the resource topic for 2009/021
Title:
Comparing With RSA
Authors: Julien Cathalo, David Naccache, Jean-Jacques Quisquater
Abstract: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 (\mathcal{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.
ePrint: https://eprint.iacr.org/2009/021
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .