Composite Keys and Signatures For Use In Internet PKI
draft-ounsworth-pq-composite-sigs-01
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
|
|
|---|---|---|---|
| Authors | Mike Ounsworth , Massimiliano Pala | ||
| Last updated | 2020-01-05 (Latest revision 2019-07-04) | ||
| Replaced by | draft-ietf-lamps-pq-composite-sigs, draft-ietf-lamps-pq-composite-sigs, draft-ietf-lamps-pq-composite-sigs | ||
| RFC stream | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
With the widespread adoption of post-quantum cryptography will come the need for an entity to possess multiple public keys on different cryptographic algorithms. Since the trustworthiness of individual post-quantum algorithms is at question, a multi-key cryptographic operation will need to be performed in such a way that breaking it requires breaking each of the component algorithms individually. This requires defining new structures for holding composite public keys and composite signature data. This document defines the structures CompositePublicKey, CompositeSignatureValue, and CompositeParams, which are sequences of the respective structure for each component algorithm. This document also defines algorithms for generating and verifying composite signatures. This document makes no assumptions about what the component algorithms are, provided that their algorithm identifiers and signature generation and verification algorithms are defined.
Authors
Mike Ounsworth
Massimiliano Pala
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)