RFC 5698 on Data Structure for the Security Suitability of Cryptographic Algorithms (DSSC)
rfc-editor@rfc-editor.org Fri, 06 November 2009 00:10 UTC
Return-Path: <rfc-editor@rfc-editor.org>
X-Original-To: ietf-announce@core3.amsl.com
Delivered-To: ietf-announce@core3.amsl.com
Received: from localhost (localhost [127.0.0.1]) by core3.amsl.com (Postfix) with ESMTP id 9373328C22F; Thu, 5 Nov 2009 16:10:56 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -16.944
X-Spam-Level:
X-Spam-Status: No, score=-16.944 tagged_above=-999 required=5 tests=[AWL=0.055, BAYES_00=-2.599, J_CHICKENPOX_93=0.6, USER_IN_DEF_WHITELIST=-15]
Received: from mail.ietf.org ([64.170.98.32]) by localhost (core3.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id LOfuEj-SnZ+x; Thu, 5 Nov 2009 16:10:55 -0800 (PST)
Received: from bosco.isi.edu (bosco.isi.edu [128.9.168.207]) by core3.amsl.com (Postfix) with ESMTP id F0CDD28C149; Thu, 5 Nov 2009 16:09:17 -0800 (PST)
Received: by bosco.isi.edu (Postfix, from userid 70) id 8A3403607EB; Thu, 5 Nov 2009 16:05:57 -0800 (PST)
To: ietf-announce@ietf.org, rfc-dist@rfc-editor.org
Subject: RFC 5698 on Data Structure for the Security Suitability of Cryptographic Algorithms (DSSC)
From: rfc-editor@rfc-editor.org
Message-Id: <20091106000557.8A3403607EB@bosco.isi.edu>
Date: Thu, 05 Nov 2009 16:05:57 -0800
Cc: ltans@ietf.org, rfc-editor@rfc-editor.org
X-BeenThere: ietf-announce@ietf.org
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: "IETF announcement list. No discussions." <ietf-announce.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/listinfo/ietf-announce>, <mailto:ietf-announce-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www.ietf.org/mail-archive/web/ietf-announce>
List-Post: <mailto:ietf-announce@ietf.org>
List-Help: <mailto:ietf-announce-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/ietf-announce>, <mailto:ietf-announce-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 06 Nov 2009 00:10:56 -0000
A new Request for Comments is now available in online RFC libraries. RFC 5698 Title: Data Structure for the Security Suitability of Cryptographic Algorithms (DSSC) Author: T. Kunz, S. Okunick, U. Pordesch Status: Standards Track Date: November 2009 Mailbox: thomas.kunz@sit.fraunhofer.de, susanne.okunick@pawisda.de, ulrich.pordesch@zv.fraunhofer.de Pages: 40 Characters: 76313 Updates/Obsoletes/SeeAlso: None I-D Tag: draft-ietf-ltans-dssc-12.txt URL: http://www.rfc-editor.org/rfc/rfc5698.txt 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] This document is a product of the Long-Term Archive and Notary Services Working Group of the IETF. This is now a Proposed Standard Protocol. STANDARDS TRACK: 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. This announcement is sent to the IETF-Announce and rfc-dist lists. To subscribe or unsubscribe, see http://www.ietf.org/mailman/listinfo/ietf-announce http://mailman.rfc-editor.org/mailman/listinfo/rfc-dist For searching the RFC series, see http://www.rfc-editor.org/rfcsearch.html. For downloading RFCs, see http://www.rfc-editor.org/rfc.html. Requests for special distribution should be addressed to either the author of the RFC in question, or to rfc-editor@rfc-editor.org. Unless specifically noted otherwise on the RFC itself, all RFCs are for unlimited distribution. The RFC Editor Team USC/Information Sciences Institute