Strengthening Digital Signatures via Randomized Hashing
draft-irtf-cfrg-rhash-01
| Document | Type | Expired Internet-Draft (cfrg RG) | |
|---|---|---|---|
| Authors | Shai Halevi , Dr. Hugo Krawczyk | ||
| Last updated | 2007-10-23 | ||
| Stream | Internet Research Task Force (IRTF) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
plain text
htmlized
pdfized
bibtex
|
||
| Stream | IRTF state | (None) | |
| Consensus boilerplate | Unknown | ||
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
https://www.ietf.org/archive/id/draft-irtf-cfrg-rhash-01.txt
Abstract
This document describes a randomized hashing scheme consisting of a simple message randomization transform that when used as a front-end to regular hash-then-sign signature schemes, such as RSA and DSS, frees these signatures from their current vulnerability to off-line collision attacks against the underlying hash function. The proposed mechanism can work with any hash function as-is and requires no change to the underlying signature algorithm. Incorporating this mechanism into existing applications requires changes that are comparable in their complexity to accommodating a new (deterministic) hash function such as SHA-256. Visit http://www.ee.technion.ac.il/~hugo/rhash/ for more information and updates on this work.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)