Thomas Kunz, Susanne Okunick, Ulrich Pordesch Data Structure for Security Suitabilities of Cryptographic Algorithms <draft-ietf-ltans-dssc-01.txt > Thomas Kunz, Susanne Okunick, Ulrich Pordesch forename.surname@sit.fraunhofer.de
Evaluation of cryptographic algorithms give a prognosis how long an algorithm will be presumably secure validity period of algorithms have been secure in the past automatically interpretable by e.g. signing and verification tools data structure for security suitability of cryptographic algorithms
DSSC approach: Data structure
DSSC: News and Changes Current release: draft-ietf-ltans-dssc-01.txt Policy contains all algorithm evaluations Current policy contains algorithms which are no longer valid Old policies need not be kept Definition of ranges for parameter values (exact, min, max, range) Definition of current parameter names RSA: “modulus” DSA: “p” and “q” Data structures in XML and ASN.1
DSSC example <Algorithm> <AlgorithmIdentifier> <Name>RSA 1024</Name> <ObjectIdentifier>1.3.14.3.2.26</ObjectIdentifier> </AlgorithmIdentifier> <Parameter name="modulus"> <Min>1024</Min> </Parameter> <Validity> <End>2007-12-31</End> </Validity> </Algorithm>