Data Structure for the Security Suitability of Cryptographic Algorithms (DSSC)
RFC 5698
|
| Document |
Type |
|
RFC - Proposed Standard
(November 2009; No errata)
|
|
Last updated |
|
2015-10-14
|
|
Stream |
|
IETF
|
|
Formats |
|
plain text
pdf
html
bibtex
|
|
Reviews |
|
|
| Stream |
WG state
|
|
(None)
|
|
Document shepherd |
|
No shepherd assigned
|
| IESG |
IESG state |
|
RFC 5698 (Proposed Standard)
|
|
Consensus Boilerplate |
|
Unknown
|
|
Telechat date |
|
|
|
Responsible AD |
|
Tim Polk
|
|
Send notices to |
|
(None)
|
Network Working Group T. Kunz
Request for Comments: 5698 Fraunhofer SIT
Category: Standards Track S. Okunick
pawisda systems GmbH
U. Pordesch
Fraunhofer Gesellschaft
November 2009
Data Structure for the Security Suitability
of Cryptographic Algorithms (DSSC)
Abstract
Since cryptographic algorithms can become weak over the years, it is
necessary to evaluate their security suitability. When signing or
verifying data, or when encrypting or decrypting data, these
evaluations must be considered. This document specifies a data
structure that enables an automated analysis of the security
suitability of a given cryptographic algorithm at a given point of
time, which may be in the past, the present, or the future.
Status of This Memo
This document specifies an Internet standards track protocol for the
Internet community, and requests discussion and suggestions for
improvements. Please refer to the current edition of the "Internet
Official Protocol Standards" (STD 1) for the standardization state
and status of this protocol. Distribution of this memo is unlimited.
Copyright Notice
Copyright (c) 2009 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the BSD License.
Kunz, et al. Standards Track [Page 1]
RFC 5698 DSSC November 2009
This document may contain material from IETF Documents or IETF
Contributions published or made publicly available before November
10, 2008. The person(s) controlling the copyright in some of this
material may not have granted the IETF Trust the right to allow
modifications of such material outside the IETF Standards Process.
Without obtaining an adequate license from the person(s) controlling
the copyright in such materials, this document may not be modified
outside the IETF Standards Process, and derivative works of it may
not be created outside the IETF Standards Process, except to format
it for publication as an RFC or to translate it into languages other
than English.
Kunz, et al. Standards Track [Page 2]
RFC 5698 DSSC November 2009
Table of Contents
1. Introduction ....................................................4
1.1. Motivation .................................................4
1.2. Terminology ................................................5
1.2.1. Conventions Used in This Document ...................5
1.3. Use Cases ..................................................5
2. Requirements and Assumptions ....................................5
2.1. Requirements ...............................................6
2.2. Assumptions ................................................6
3. Data Structures .................................................7
3.1. SecuritySuitabilityPolicy ..................................7
3.2. PolicyName .................................................8
3.3. Publisher ..................................................9
3.4. PolicyIssueDate ............................................9
3.5. NextUpdate .................................................9
3.6. Usage ......................................................9
3.7. Algorithm ..................................................9
3.8. AlgorithmIdentifier .......................................10
3.9. Evaluation ................................................10
3.10. Parameter ................................................11
3.11. Validity .................................................12
3.12. Information ..............................................12
3.13. Signature ................................................12
Show full document text