On the possibility of constructing meaningful hash collisions for public keys

A.K. Lenstra, B.M.M. Weger, de

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

19 Citations (Scopus)


It is sometimes argued that finding meaningful hash collisions might prove difficult. We show that for several common public key systems it is easy to construct pairs of meaningful and secure public key data that either collide or share other characteristics with the hash collisions as quickly constructed by Wang et al. We present some simple results, investigate what we can and cannot (yet) achieve, and formulate some open problems of independent interest. We are not yet aware of truly interesting practical implications. Nevertheless, our results may be relevant for the practical assessment of the recent hash collision results. For instance, we show how to construct two different X.509 certificates that contain identical signatures.
Original languageEnglish
Title of host publicationInformation Security and Privacy
Subtitle of host publication10th Australasian Conference, ACISP 2005, Brisbane, Australia, July 4-6, 2005. Proceedings
EditorsC. Boyd, J.M. González Nieto
Place of PublicationBerlin
Number of pages13
ISBN (Electronic)978-3-540-31684-8
ISBN (Print)3-540-26547-3, 978-3-540-26547-4
Publication statusPublished - 2005

Publication series

NameLecture Notes in Computer Science (LNCS)
ISSN (Print)0302-9743

Cite this