Data Structure for the Security Suitability of Cryptographic Algorithms
RFC 5698, “Data Structure for the Security Suitability of Cryptographic Algorithms”, is a Proposed Standard document published in November 2009 by T. Kunz, S. Okunick, U. Pordesch. The canonical text is published by the RFC Editor.
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. [STANDARDS-TRACK]
What “Proposed Standard” means
An entry-level standards-track specification: stable, peer-reviewed and a solid basis for implementation, though it may still evolve before becoming an Internet Standard.
The canonical text of RFC 5698 is hosted at rfc-editor.org. Available in TXT,HTML.
- RFC 5697 Other Certificates Extension
- RFC 5696 Baseline Encoding and Transport of Pre-Congestion Information
- RFC 5695 MPLS Forwarding Benchmarking Methodology for IP Flows
- RFC 5701 IPv6 Address Specific BGP Extended Community Attribute
- RFC 5694 Peer-to-Peer Architecture: Definition, Taxonomies, Examples, and Applicability
- RFC 5702 Use of SHA-2 Algorithms with RSA in DNSKEY and RRSIG Resource Records for DNSSEC
- RFC 5693 Application-Layer Traffic Optimization Problem Statement
- RFC 5703 Sieve Email Filtering: MIME Part Tests, Iteration, Extraction, Replacement, and Enclosure