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 quasi-linear-time, quasi-constant-space integer set equality test.
An interesting advantage of the proposed algorithm is its ability to compare mss without sorting them. This can prove useful when comparing very large files which are read-only or otherwise hard to sort (e.g. on tapes, distributed across web-sites etc).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bellare, M., Rogaway, P.: The exact security of digital signatures - How to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399–416. Springer, Heidelberg (1996)
Ben-Or, M.: Lower bounds for algebraic computation trees. In: STOC 1983 - Proceedings of the fifteenth annual ACM symposium on the Theory of Computing, pp. 80–86. ACM, New York (1983)
Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. Journal of Cryptology 17, 297–319 (2004)
Cathalo, J., Coron, J.-S., Naccache, D.: From fixed-length to arbitrary-length RSA encoding schemes revisited. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 234–243. Springer, Heidelberg (2005)
Clarke, D., Devadas, S., van Dijk, M., Gassend, B., Suh, G.: Incremental multiset hash functions and their application to memory integrity checking. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 188–207. Springer, Heidelberg (2003)
Coron, J.-S., Koeune, F., Naccache, D.: From fixed-length to arbitrary-length RSA padding schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 90–96. Springer, Heidelberg (2000)
Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM 33(4), 210–217 (1986)
Goldwasser, S., Micali, S., Rivest, R.: A Digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of computing 17, 281–308 (1988)
Katriel, I.: On the algebraic complexity of set equality and inclusion. Information Processing Letters 92, 175–178 (2004)
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cathalo, J., Naccache, D., Quisquater, JJ. (2009). Comparing with RSA. In: Parker, M.G. (eds) Cryptography and Coding. IMACC 2009. Lecture Notes in Computer Science, vol 5921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10868-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-10868-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10867-9
Online ISBN: 978-3-642-10868-6
eBook Packages: Computer ScienceComputer Science (R0)