Defining Elliptic Curve Cryptography Algorithms for use with DKIM
draft-ietf-dcrup-dkim-ecc-01
| Document | Type | Expired Internet-Draft (dcrup WG) | |
|---|---|---|---|
| Author | Scott Rose | ||
| Last updated | 2017-12-23 (latest revision 2017-06-21) | ||
| Stream | IETF | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized (tools)
htmlized
bibtex
|
||
| Stream | WG state | Dead WG Document | |
| Document shepherd | No shepherd assigned | ||
| IESG | IESG state | Expired | |
| Consensus Boilerplate | Unknown | ||
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-ietf-dcrup-dkim-ecc-01.txt
Abstract
DomainKeys Identified Mail (DKIM) uses digital signature to associate a message with a given sending domain. Currently, there is only one cryptography algorithm defined for use with DKIM (RSA). This document defines four new elliptic curve cryptography algorithms for use with DKIM. This will allow for algorithm agility if a weakness is found in RSA, and allows for smaller key length to provide the same digital signature strength.
Authors
Scott Rose (scott.rose@nist.gov)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)