<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.1 (Ruby 3.0.2) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-vaira-pquip-pqc-use-cases-00" category="info" submissionType="IETF" xml:lang="en" version="3">
  <!-- xml2rfc v2v3 conversion 3.18.1 -->
  <front>
    <title abbrev="PQC use cases">Post-quantum cryptography use cases</title>
    <seriesInfo name="Internet-Draft" value="draft-vaira-pquip-pqc-use-cases-00"/>
    <author initials="A." surname="Vaira" fullname="Antonio Vaira">
      <organization abbrev="Siemens">Siemens</organization>
      <address>
        <postal>
          <street>Werner-von-Siemens-Strasse 1</street>
          <city>Munich</city>
          <code>80333</code>
          <country>Germany</country>
        </postal>
        <email>antonio.vaira@siemens.com</email>
        <uri>https://www.siemens.com</uri>
      </address>
    </author>
    <author initials="H." surname="Brockhaus" fullname="Hendrik Brockhaus">
      <organization abbrev="Siemens">Siemens</organization>
      <address>
        <postal>
          <street>Werner-von-Siemens-Strasse 1</street>
          <city>Munich</city>
          <code>80333</code>
          <country>Germany</country>
        </postal>
        <email>hendrik.brockhaus@siemens.com</email>
        <uri>https://www.siemens.com</uri>
      </address>
    </author>
    <author initials="A." surname="Railean" fullname="Alexander Railean">
      <organization abbrev="Siemens">Siemens</organization>
      <address>
        <postal>
          <street>Werner-von-Siemens-Strasse 1</street>
          <city>Munich</city>
          <code>80333</code>
          <country>Germany</country>
        </postal>
        <email>alexander.railean@siemens.com</email>
        <uri>https://www.siemens.com</uri>
      </address>
    </author>
    <author initials="J." surname="Gray" fullname="John Gray">
      <organization abbrev="Entrust">Entrust</organization>
      <address>
        <postal>
          <street>1187 Park Place</street>
          <city>Minneapolis</city>
          <region>MN</region>
          <code>55379</code>
          <country>United States of America</country>
        </postal>
        <email>john.gray@entrust.com</email>
        <uri>https://www.entrust.com</uri>
      </address>
    </author>
    <author initials="M." surname="Ounsworth" fullname="Mike Ounsworth">
      <organization abbrev="Entrust">Entrust</organization>
      <address>
        <postal>
          <street>1187 Park Place</street>
          <city>Minneapolis</city>
          <region>MN</region>
          <code>55379</code>
          <country>United States of America</country>
        </postal>
        <email>mike.ounsworth@entrust.com</email>
        <uri>https://www.entrust.com</uri>
      </address>
    </author>
    <date year="2023" month="October" day="23"/>
    <area>Security</area>
    <workgroup>Post-Quantum Use In Protocols</workgroup>
    <keyword>post-quantum cryptography</keyword>
    <keyword>PQC use cases</keyword>
    <abstract>
      <?line 133?>

<t>This document focuses on the critical challenge of migrating long-term security assertions with security requirements spanning over a decade, encompassing X.509 certificates, including those that serve as manufacturer issued certificates (IDevID), signed firmware/software, and other electronic artifacts. We investigate a range of migration strategies, specifically hybrid cryptography and the feasibility of stateful Hash-Based Signatures (HBS) schemes, including its pros and cons. To offer a comprehensive context, we present a list of use cases centered around long-lived security assertions, categorize them, and evaluate them against the various migration strategies identified. We also aim at listing pros and cons associated with each method.</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        The latest revision of this draft can be found at <eref target="https://avaira77.github.io/pq-ietf-usecase/draft-vaira-pquip-pq-use-cases.html"/>.
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-vaira-pquip-pqc-use-cases/"/>.
      </t>
      <t>
        Discussion of this document takes place on the
        Post-Quantum Use In Protocols Working Group mailing list (<eref target="mailto:pqc@ietf.org"/>),
        which is archived at <eref target="https://mailarchive.ietf.org/arch/browse/pqc/"/>.
        Subscribe at <eref target="https://www.ietf.org/mailman/listinfo/pqc/"/>.
      </t>
      <t>Source for this draft and an issue tracker can be found at
        <eref target="https://github.com/avaira77/pq-ietf-usecase"/>.</t>
    </note>
  </front>
  <middle>
    <?line 137?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>The purpose of this document is to compile a list of real-world use cases, focusing on long-term security assertions. This document additionally aims at evaluating, for each use case, a set of migration strategies, like hybrid cryptography, including multiple and composite signatures, and the feasibility of using stateful Hash-Based Signature (HBS) schemes,  evaluating the pros and cons of each approach.</t>
      <t>The document is structured into the following sections: "Post-quantum migration strategies", lists possible migration approaches; "Use case collection", describes, at a high level, the use cases at hand, including an analysis of the pros and cons for each of the migration strategies applicable.</t>
      <section anchor="requirements-language">
        <name>Requirements Language</name>
        <t>The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL
NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>",
"<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as
described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
        <?line -18?>

</section>
      <section anchor="problem-statement">
        <name>Problem Statement</name>
        <t>The transition to post-quantum cryptography poses a distinctive challenge in the domain of modern digital cryptography. This peculiarity stems from the absence of complete trust in both the outgoing and incoming cryptographic algorithms, crucial for ensuring data security throughout their required lifespans. This is of particular significance in guaranteeing the security of long-lived digital signatures, which are integral to secure software update workflows and manufacturer issued certificates, among other applications. Despite having NIST finalists for post-quantum cryptographic signature algorithms, concerns persist regarding their long-term security. At present, only stateful Hash-Based Signature schemes are considered secure.
At the same time, regulatory bodies (TODO: add references) mandate the incorporation of post-quantum cryptographic techniques, and in some cases, hybrid cryptography, as a proactive response to the quantum threat. As of now, the most effective strategies for transitioning to protect long-lasting digital signatures across diverse usage scenarios remain uncertain.</t>
      </section>
      <section anchor="scope">
        <name>Scope</name>
        <t>The scope of this document is to compile a list of real-life use cases characterized by long-term security requirements, which are typically challenging to update, for example no over the air update mechanisms are available. These scenarios necessitate an early implementation of post-quantum cryptography migration strategies. Consequently, mitigation mechanisms must be introduced, given the limited experience with post-quantum cryptography to date. Furthermore, it is essential to consider regional regulations that may mandate the use of hybrid cryptography in specific instances.</t>
      </section>
      <section anchor="terminology">
        <name>Terminology</name>
        <t>This document makes use of the terminology defined in <xref target="RFC4949"/>, <xref target="RFC5280"/>, <xref target="RFC9019"/>,  <xref target="I-D.ietf-pquip-pqc-engineers"/>, <xref target="I-D.ietf-pquip-pqt-hybrid-terminology"/> and TODO: add ref to composite signature drafts.</t>
      </section>
    </section>
    <section anchor="post-quantum-migration-strategies-for-signing">
      <name>Post-quantum Migration Strategies for Signing</name>
      <t>People are considering which technological concepts are suitable to solve the problem of a secure migration from classical cryptography to quantum computer safe cryptographic algorithms. A variety of approaches are being discussed. In the following, we would like to briefly introduce the approaches under discussion and refer to the respective relevant documents for further details.
For a general introduction, we also refer to <xref target="I-D.ietf-pquip-pqc-engineers"/>.</t>
      <section anchor="stateful-hash-based-signature-schemes">
        <name>Stateful Hash-based Signature Schemes</name>
        <t>The only algorithms that can be considered safe against attacks with quantum computers with sufficient certainty today are the stateful hash-based signature (HBS) schemes <xref target="NIST.SP.800-208"/> <xref target="NIST.FIPS.186-5"/> XMSS <xref target="RFC8391"/> and LMS <xref target="RFC8554"/>.
According to NIST, these stateful HBS algorithms offer better performance than stateless HBS algorithms, and the underlying technology is considered well understood.  Moreover stateful HBS algorithms are considered safe against attacks by quantum computers but the lack of standard operating procedures for how to manage state makes adoption harder. Especially for the secure signing of data that can be signed repeatedly over a very long period of time and whose signatures must be able to be securely validated with the same public key, stateful HBS do not appear to be suitable. This is because there are currently insufficient solutions for the replacement of the hardware security modules used and for disaster recovery cases.</t>
      </section>
      <section anchor="stateless-hash-based-signature-schemes">
        <name>Stateless Hash-based Signature Schemes</name>
        <t><xref target="NIST.FIPS.205"/> specifies the ML-SLH (SPHINCS+) algorithm.  It is a stateless hash-based signature algorithm and is considered safe against attacks by quantum computers.  The advantage of this algorithm is that the state problem is resolved as part of the algorithm.  However, the tradeoff is that signature sizes are often an order of magnitude larger than XMSS or LMS.  This may make deploying these algorithms on constrained devices infeasible.</t>
      </section>
      <section anchor="protocols">
        <name>Protocol Revision (Cryptographic Agility)</name>
        <t>Agility in security protocols and message formats, such as IP Security (IPsec) and Internet Key Exchange (IKE) <xref target="RFC6071"/>, Transport Layer Security (TLS)<xref target="RFC8446"/>, Secure/Multipurpose Internet Mail Extensions (S/MIME)<xref target="RFC8551"/>, is usually understood as the dynamic referencing of the algorithms to be used. A concrete migration strategy that allows the existing and future cryptographic algorithms to be used simultaneously during a transition period is usually not described in the respective standards.</t>
        <t>An extension of the existing standards would be needed to integrate the required agility into the existing protocols and formats. This is a lot of effort for standardization and implementations if a basic functionality, such as multiple signatures, e.g., in Cryptographic Message Syntax (CMS) <xref target="RFC5652"/>, is not already available. But even in the case of S/MIME and CMS, a corresponding profiling is still necessary to describe how the multiple signatures are to be used specifically for the migration.</t>
      </section>
      <section anchor="multiple-signatures">
        <name>Multiple Signatures</name>
        <t>Several signatures have the approach of defining a second alternative signature in addition to the primary signature in the protocol or format, which can be transported in the protocol or format. In addition to the definition of the alternative signature, the associated signing algorithm and, if applicable, the associated public key or a reference to it must also be transferred. For X.509 public key certificates, this is defined in <xref target="X.509"/>. Work is also underway for other protocols and formats. This approach overlaps with the protocol and format extension approach described in <xref target="protocols"/>.</t>
        <t>An alternative approach is to encode a second signature in a second certificate and bind it to the first one by a reference. For example, an implementation can decide based on its policy whether only the first certificate or the second or both certificates should be used for authentication. Further descriptions of this approach can be found in A Mechanism for Encoding Differences in Paired Certificates <xref target="I-D.bonnell-lamps-chameleon-certs"/> and Related Certificates for Use in Multiple Authentications within a Protocol <xref target="I-D.ietf-lamps-cert-binding-for-multi-auth"/>.</t>
      </section>
      <section anchor="composite-signatures">
        <name>Composite Signatures</name>
        <t>The goal of composite signatures is to define a signature object to be used with any protocol or format. It contains two signatures in a single atomic container that have been generated using two different cryptographic algorithms. The goal of this approach is to define a signature format which requires both contained signatures to be verified.  In this way, the security properties of the classical signature and another signature that is secure when attacked by a quantum computer are used in the protocol or format without having to adapt them.</t>
        <t>In order for this approach to be applicable in arbitrary protocols and formats, a composite key must be defined in addition to the composite signature. According to the definition of composite signatures, a composite public is a single atomic container composed of two public keys. The associated composite private key is a single atomic private key that is composed of the two private keys which correspond to the two public keys contained in the composite public key.</t>
        <t>This concept is described in Composite Signatures For Use In Internet PKI <xref target="I-D.ounsworth-pq-composite-sigs"/> in more detail.</t>
      </section>
    </section>
    <section anchor="sec-usecases">
      <name>Use cases collection</name>
      <t>EDNOTE9: The collection of use cases requires further edit.</t>
      <t>This section is the core of this document. For each use case, we present a concise overview of the use case and a list of potential migration strategies. For each migration strategy, we highlight the advantages and disadvantages that stem from considering real-world deployment scenarios.</t>
      <section anchor="industrial-communication-protocols-that-rely-on-ietf-rfcs">
        <name>Industrial communication protocols (that rely on IETF RFCs)</name>
        <t>Several industrial communication protocols, traditionally orthogonal to IP network infrastructure, are progressively being updated to make use of standard IP network infrastructure hence rely on standard security mechanisms, like for example TLS 1.3 <xref target="RFC8446"/>.</t>
        <t>The building automation industry makes use of the data communication protocol 'Building Automation and Control Networks / Secure Connect' (BACnet/SC) <xref target="ANSI_ASHRAE.Standard.135-2016"/>. BACnet was defined before 1995, when the TCP/IP protocol suite was expensive and not available for smaller devices common in building automation. BACnet/SC proposes a new datalink layer option that makes full use of TLS secured WebSocket connections. This new BACnet/SC datalink layer option uses a virtual hub-and-spoke topology where the spokes are WebSocket connections from the nodes to the hub.</t>
        <t>The main features of BACnet/SC are:</t>
        <ul spacing="normal">
          <li>
            <t>it makes use of WebSockets secured via TLS 1.3,</t>
          </li>
          <li>
            <t>it relies on X.509 certificates to authenticate the nodes in the network,</t>
          </li>
          <li>
            <t>DNS host name resolution and DHCP are supported,</t>
          </li>
          <li>
            <t>it is agnostic to IP versions (IPv4 or IPv6),</t>
          </li>
          <li>
            <t>it can be NATted.</t>
          </li>
        </ul>
        <t>BACnet/SC's implementation adheres to established industry standards defined in IETF RFCs. Specifically the <xref target="Addendum.bj.to.ANSI_ASHRAE.Standard.135-2016"/> references to <xref target="RFC7468"/>, when defining the format in which operational certificates and signing CA should be installed onto the target device at configuration time.</t>
        <t>The security of the BACnet/SC protocol, as well as of similar industrial protocols, relies on TLS 1.3 <xref target="RFC8446"/>, therefore implications of post-quantum cryptography have to be considered in both the TLS handshake and in the X.509 certificates used for the authentication.</t>
        <t>Furthermore, the regulations applicable to the environment the BACnet/SC-enabled devices is operated in may necessitate the usage of a specific migration strategy, e.g., the use of hybrid cryptography.</t>
        <section anchor="suitable-migration-mechanisms">
          <name>Suitable migration mechanisms</name>
          <ul spacing="normal">
            <li>
              <t>Multiple Signatures - These can be used to give the environment resilience to cryptanalysis attacks and technological advancements because should a critical break happen, the secondary signature should allow for addition time for upgrade which will be welcome given the location constraints. This would require cryptographic library updates as well as protocol level changes to support multiple signatures. Additionally, it would require the introduction of security policy to allow to switch the validation from one signature to the other, if needed. These modifications to the protocols, and introduction of additional policies will not be easily attainable due to the interdependencies of protocols and might come at a detriment of interoperability especially cross-vendor interoperability.</t>
            </li>
            <li>
              <t>Composite Signatures - Similar to multiple signatures but may only require updates to the cryptographic libraries as well as a signature algorithm update in protocols. It is likely composite signatures would be easier to deploy as single key and signature objects are used which is similar to what has historically been used. In the use case at hand, this would be the best fit, because it would require no modifications of industrial protocol, which are usually harder to update.</t>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="software-update">
        <name>Software update</name>
        <t>TBD</t>
      </section>
      <section anchor="firmware-update">
        <name>Firmware update</name>
        <t>EDNOTE3: The firmware update use case, and the software update one, have to be further defined and its differences have to be made more clear.</t>
        <t>Firmware, defined in <xref target="RFC4949"/>, refers to computer programs and data stored in hardware, typically in read-only memory (ROM) or programmable read-only memory (PROM). These programs and data are non-modifiable during execution, offering low-level hardware control.</t>
        <t>Secure firmware updates are crucial for ensuring device security and long-term operation, especially in industrial, and critical infrastructure fields, where devices can stay active for decades. Such updates encompass tasks like introducing new trust anchors and upgrading cryptographic algorithm capabilities. However, upgrading every device's security capabilities isn't always feasible due to resource, accessibility, and cost constraints. Some "simple" devices may not support secure firmware updates at all.</t>
        <t>Firmware updates are typically authenticated by the Original Equipment Manufacturer (OEM) by means of a digital signing process. At a high level, a usual process involves, a firmware build server, which requests a signature from a signing service. The signing service, often safeguarding the signing private key in secure environments like Hardware Security Modules (HSMs), returns the signature after authenticating the request.</t>
        <t>Subsequently, the firmware is distributed to target devices, which in turn must validate the firmware signature against a Trust Anchor (TA). The TA can be an X.509 certificate, a public key, or a hash of a combination of both, depending on the OEM's security measures.</t>
        <t>These devices are typically deployed in highly regulated environments, in remote or physically constrained locations where performing upgrades is challenging, or in cases where the cost of upgrading is prohibitively high. The immutability of these devices can also be viewed as a security feature, as it restricts potential attack vectors associated with over-the-air updates. These devices are designed with a long operational lifespan in mind, often spanning several decades. Notable examples of such devices encompass:</t>
        <ul spacing="normal">
          <li>
            <t>Vehicles - scale of deployment or vehicle recall difficulties</t>
          </li>
          <li>
            <t>Satellites - no 'on-site' service reasonably possible</t>
          </li>
          <li>
            <t>Servers and network devices - air-gapped, locked-down DCs, geographically distributed</t>
          </li>
          <li>
            <t>Government infrastructure - power grids, nuclear power station equipment, etc.</t>
          </li>
          <li>
            <t>Smart meters - device owned by the utility company, deployed in private homes.</t>
          </li>
          <li>
            <t>Smart cards – used for authenticating to workstations and buildings, or electronic document signing.</t>
          </li>
          <li>
            <t>Security Tokens – such as FIDO2, cheap devices that users will typically not patch.</t>
          </li>
        </ul>
        <section anchor="suitable-migration-mechanisms-1">
          <name>Suitable migration mechanisms</name>
          <t>Given the long term requirements of the signatures and physically contrained locations, a signature used in these environments must be able to withstand future crytanalysis attacks as well as technological advancements.  Therefore the following migration mechanisms should be considerd for these enviornments:</t>
          <ul spacing="normal">
            <li>
              <t>Multiple Signatures - These can be used to give the environment resilience to crytanalysis attacks and technological advancements because should a critical break happen, the secondary signature should allow for addition time for upgrade which will be welcome given the location constraints.  This would require cryptographic library updates as well as protocol level changes to support multiple signatures.</t>
            </li>
            <li>
              <t>Composite Signatures - Similar to multiple signatures but may only require updates to the cryptographic libraries as well as a signature algorithm update in protocols.  It is likely composite signatures would be easier to deploy as single key and signature objects are used which is similar to what has historically be used.</t>
            </li>
            <li>
              <t>Stateless hash based signatures - In constrained locations where larger signature sizes are acceptable, direct upgrade to a stateless hash based signature may be sufficient.</t>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="trust-anchor-deployment">
        <name>Trust Anchor deployment</name>
        <t>Trust Anchors, such as X.509 Root CA certificates and raw public keys, must be made accessible before they can be used for signature validation. In scenarios like remote software updates, a Trust Anchor X.509 certificate, for instance, must be installed on a target device to enable the validation of certificate chains. While deployment of Trust Anchors may be relatively straightforward for "corporate IT" and "public web" applications, it can still be a time-consuming process to ensure that a new Trust Anchor X.509 certificate is propagated throughout the entire ecosystem. Additionally, when dealing with post-quantum Trust Anchors, an extra layer of complexity arises as the desired underlying cryptography may not yet be supported by the target device or software.</t>
        <t>Two common variations of this use case are:</t>
        <ul spacing="normal">
          <li>
            <t>injection within a factory: in industrial contexts, Trust Anchors are typically injected into target devices during the manufacturing phase. Devices leaving the assembly line do not possess any credentials or Trusted Anchors initially. To bootstrap a Trust Anchor, the device is placed in a physically secure environment accessible only to trustworthy personnel. This injection can occur during manufacturing or when a device is being resold, but it's critical to note that not all scenarios support this method, potentially requiring the return of the device to the OEM for post-quantum Trust Anchor injection or it may be even not supported at all.</t>
          </li>
          <li>
            <t>injection via software and firmware updates: for devices where the Trust Anchor is not burned onto the device, for example in less constrained devices and IT equipment, post-quantum Trust Anchors can be injected through software or firmware update mechanisms. The deployment of these Trust Anchors may leverage existing update mechanisms and traditional cryptography to minimize effort. However, this approach necessitates the distribution of the new Trust Anchors well in advance of any suspicion that traditional cryptography may become vulnerable. Given the lead time required to ensure widespread distribution, the time window where this mechanism is suitable is further reduced.</t>
          </li>
        </ul>
        <section anchor="suitable-migration-mechanisms-2">
          <name>Suitable migration mechanisms</name>
          <t>Trust anchors that have limited to no ability to be upgraded but which must be able to be trusted for a long time will require the use of signatures which must be able to withstand future crytanalysis attacks as well as technological advancements.  The following migration mechanisms should be considered for these environments:</t>
          <ul spacing="normal">
            <li>
              <t>Multiple Signatures - These can be used to give the environment resilience to crytanalysis attacks and technological advancements because should a critical break happen, the secondary signature should allow for addition time for upgrade which will be welcome given the location constraints.  This would require cryptographic library updates as well as protocol level changes to support multiple signatures.</t>
            </li>
            <li>
              <t>Composite Signatures - Similar to multiple signatures but may only require updates to the cryptographic libraries as well as a signature algorithm update in protocols.  It is likely composite signatures would be easier to deploy as single key and signature objects are used which is similar to what has historically be used.</t>
            </li>
            <li>
              <t>Stateless hash based signatures - In constrained locations where larger signature sizes are acceptable, direct upgrade to a stateless hash based signature may be sufficient.</t>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="timestamping">
        <name>Timestamping</name>
        <t>EDNOTE5: RFC 4998 - we could study this to understand how to re-sign old timestamp messages. Question: does re-signing give protection against a full break of the original algorithm.
AV: an example is provided by "ETSI EN 319 142-1" (and "ETSI EN 319 142-2"), the standards define PDF advanced electronic signatures which have legal value EU. I assume that this concept may be extended to similar use cases, i.e., wherever long term validation is required new time-stamps may be added using post-quantum cryptography</t>
        <section anchor="suitable-migration-mechanisms-3">
          <name>Suitable migration mechanisms</name>
          <t>TBD</t>
        </section>
      </section>
      <section anchor="cms-smime">
        <name>CMS (S/MIME)</name>
        <t>EDNOTE6: You can do infinite nesting in CMS.</t>
        <t>EDNOTE7: The difficulty here will be non-uniform adoption: there are many many many email clients in the world at varying levels of maturity and maintenance. It is expected that some email clients will support PQ algorithms quickly while others may take more time or never adopt them fully. Suggestion to IETF: Study be put into RFC5652 the Cryptographic Message Syntax into signing messages with multiple signatures in a way that unsupported signatures will be ignored (likely this already "just works"). Email encryption probably requires either a flag day (you simply cannot encrypt a message for a recipient if you do not understand their PQ certificate)</t>
        <section anchor="suitable-migration-mechanisms-4">
          <name>Suitable migration mechanisms</name>
          <t>TBD</t>
        </section>
      </section>
      <section anchor="additional-use-cases">
        <name>Additional use cases</name>
        <t>EDNOTE8: TO-DOs:</t>
        <ul spacing="normal">
          <li>
            <t>add additional post-quantum relevant use cases which cover aspects not covered so far, this could also include use cases that are not common in our line of work (e.g., FAA airworthiness certifications, medical records, etc.), maybe contributed by other participants,</t>
          </li>
          <li>
            <t>any party that would be interested in contributing in this work may add additional post-quantum relevant use cases that are closer to her experience/field,</t>
          </li>
          <li>
            <t>the goal is to cover as much ground as possible in terms of use cases and to be able to define categories of use cases,</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="IANA">
      <name>IANA Considerations</name>
      <t>This memo includes no request to IANA.</t>
    </section>
    <section anchor="Security">
      <name>Security Considerations</name>
      <t>This document should not affect the security of the Internet.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="IEEE.802.1AR-2018">
          <front>
            <title>IEEE Standard for Local and Metropolitan Area Networks - Secure Device Identity</title>
            <author>
              <organization/>
            </author>
            <date month="July" year="2018"/>
          </front>
          <seriesInfo name="DOI" value="10.1109/ieeestd.2018.8423794"/>
          <seriesInfo name="ISBN" value="[&quot;9781504450195&quot;]"/>
          <refcontent>IEEE</refcontent>
        </reference>
        <reference anchor="RFC4949">
          <front>
            <title>Internet Security Glossary, Version 2</title>
            <author fullname="R. Shirey" initials="R." surname="Shirey"/>
            <date month="August" year="2007"/>
            <abstract>
              <t>This Glossary provides definitions, abbreviations, and explanations of terminology for information system security. The 334 pages of entries offer recommendations to improve the comprehensibility of written material that is generated in the Internet Standards Process (RFC 2026). The recommendations follow the principles that such writing should (a) use the same term or definition whenever the same concept is mentioned; (b) use terms in their plainest, dictionary sense; (c) use terms that are already well-established in open publications; and (d) avoid terms that either favor a particular vendor or favor a particular technology or mechanism over other, competing techniques that already exist or could be developed. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="FYI" value="36"/>
          <seriesInfo name="RFC" value="4949"/>
          <seriesInfo name="DOI" value="10.17487/RFC4949"/>
        </reference>
        <reference anchor="RFC4998">
          <front>
            <title>Evidence Record Syntax (ERS)</title>
            <author fullname="T. Gondrom" initials="T." surname="Gondrom"/>
            <author fullname="R. Brandner" initials="R." surname="Brandner"/>
            <author fullname="U. Pordesch" initials="U." surname="Pordesch"/>
            <date month="August" year="2007"/>
            <abstract>
              <t>In many scenarios, users must be able prove the existence and integrity of data, including digitally signed data, in a common and reproducible way over a long and possibly undetermined period of time. This document specifies the syntax and processing of an Evidence Record, a structure designed to support long-term non-repudiation of existence of data. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4998"/>
          <seriesInfo name="DOI" value="10.17487/RFC4998"/>
        </reference>
        <reference anchor="RFC5280">
          <front>
            <title>Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile</title>
            <author fullname="D. Cooper" initials="D." surname="Cooper"/>
            <author fullname="S. Santesson" initials="S." surname="Santesson"/>
            <author fullname="S. Farrell" initials="S." surname="Farrell"/>
            <author fullname="S. Boeyen" initials="S." surname="Boeyen"/>
            <author fullname="R. Housley" initials="R." surname="Housley"/>
            <author fullname="W. Polk" initials="W." surname="Polk"/>
            <date month="May" year="2008"/>
            <abstract>
              <t>This memo profiles the X.509 v3 certificate and X.509 v2 certificate revocation list (CRL) for use in the Internet. An overview of this approach and model is provided as an introduction. The X.509 v3 certificate format is described in detail, with additional information regarding the format and semantics of Internet name forms. Standard certificate extensions are described and two Internet-specific extensions are defined. A set of required certificate extensions is specified. The X.509 v2 CRL format is described in detail along with standard and Internet-specific extensions. An algorithm for X.509 certification path validation is described. An ASN.1 module and examples are provided in the appendices. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5280"/>
          <seriesInfo name="DOI" value="10.17487/RFC5280"/>
        </reference>
        <reference anchor="RFC5652">
          <front>
            <title>Cryptographic Message Syntax (CMS)</title>
            <author fullname="R. Housley" initials="R." surname="Housley"/>
            <date month="September" year="2009"/>
            <abstract>
              <t>This document describes the Cryptographic Message Syntax (CMS). This syntax is used to digitally sign, digest, authenticate, or encrypt arbitrary message content. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="70"/>
          <seriesInfo name="RFC" value="5652"/>
          <seriesInfo name="DOI" value="10.17487/RFC5652"/>
        </reference>
        <reference anchor="RFC6421">
          <front>
            <title>Crypto-Agility Requirements for Remote Authentication Dial-In User Service (RADIUS)</title>
            <author fullname="D. Nelson" initials="D." role="editor" surname="Nelson"/>
            <date month="November" year="2011"/>
            <abstract>
              <t>This memo describes the requirements for a crypto-agility solution for Remote Authentication Dial-In User Service (RADIUS). This document is not an Internet Standards Track specification; it is published for informational purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6421"/>
          <seriesInfo name="DOI" value="10.17487/RFC6421"/>
        </reference>
        <reference anchor="RFC7468">
          <front>
            <title>Textual Encodings of PKIX, PKCS, and CMS Structures</title>
            <author fullname="S. Josefsson" initials="S." surname="Josefsson"/>
            <author fullname="S. Leonard" initials="S." surname="Leonard"/>
            <date month="April" year="2015"/>
            <abstract>
              <t>This document describes and discusses the textual encodings of the Public-Key Infrastructure X.509 (PKIX), Public-Key Cryptography Standards (PKCS), and Cryptographic Message Syntax (CMS). The textual encodings are well-known, are implemented by several applications and libraries, and are widely deployed. This document articulates the de facto rules by which existing implementations operate and defines them so that future implementations can interoperate.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7468"/>
          <seriesInfo name="DOI" value="10.17487/RFC7468"/>
        </reference>
        <reference anchor="RFC8446">
          <front>
            <title>The Transport Layer Security (TLS) Protocol Version 1.3</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla"/>
            <date month="August" year="2018"/>
            <abstract>
              <t>This document specifies version 1.3 of the Transport Layer Security (TLS) protocol. TLS allows client/server applications to communicate over the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery.</t>
              <t>This document updates RFCs 5705 and 6066, and obsoletes RFCs 5077, 5246, and 6961. This document also specifies new requirements for TLS 1.2 implementations.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8446"/>
          <seriesInfo name="DOI" value="10.17487/RFC8446"/>
        </reference>
        <reference anchor="RFC9019">
          <front>
            <title>A Firmware Update Architecture for Internet of Things</title>
            <author fullname="B. Moran" initials="B." surname="Moran"/>
            <author fullname="H. Tschofenig" initials="H." surname="Tschofenig"/>
            <author fullname="D. Brown" initials="D." surname="Brown"/>
            <author fullname="M. Meriac" initials="M." surname="Meriac"/>
            <date month="April" year="2021"/>
            <abstract>
              <t>Vulnerabilities in Internet of Things (IoT) devices have raised the need for a reliable and secure firmware update mechanism suitable for devices with resource constraints. Incorporating such an update mechanism is a fundamental requirement for fixing vulnerabilities, but it also enables other important capabilities such as updating configuration settings and adding new functionality.</t>
              <t>In addition to the definition of terminology and an architecture, this document provides the motivation for the standardization of a manifest format as a transport-agnostic means for describing and protecting firmware updates.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9019"/>
          <seriesInfo name="DOI" value="10.17487/RFC9019"/>
        </reference>
        <reference anchor="I-D.ietf-pquip-pqc-engineers">
          <front>
            <title>Post-Quantum Cryptography for Engineers</title>
            <author fullname="Aritra Banerjee" initials="A." surname="Banerjee">
              <organization>Nokia</organization>
            </author>
            <author fullname="Tirumaleswar Reddy.K" initials="T." surname="Reddy.K">
              <organization>Nokia</organization>
            </author>
            <author fullname="Dimitrios Schoinianakis" initials="D." surname="Schoinianakis">
              <organization>Nokia</organization>
            </author>
            <author fullname="Tim Hollebeek" initials="T." surname="Hollebeek">
              <organization>DigiCert</organization>
            </author>
            <date day="20" month="October" year="2023"/>
            <abstract>
              <t>   The presence of a Cryptographically Relevant Quantum Computer (CRQC)
   would render state-of-the-art, traditional public-key algorithms
   deployed today obsolete, since the assumptions about the
   intractability of the mathematical problems for these algorithms that
   offer confident levels of security today no longer apply in the
   presence of a CRQC.  This means there is a requirement to update
   protocols and infrastructure to use post-quantum algorithms, which
   are public-key algorithms designed to be secure against CRQCs as well
   as classical computers.  These new public-key algorithms behave
   similarly to previous public key algorithms, however the intractable
   mathematical problems have been carefully chosen so they are hard for
   CRQCs as well as classical computers.  This document explains why
   engineers need to be aware of and understand post-quantum
   cryptography.  It emphasizes the potential impact of CRQCs on current
   cryptographic systems and the need to transition to post-quantum
   algorithms to ensure long-term security.  The most important thing to
   understand is that this transition is not like previous transitions
   from DES to AES or from SHA-1 to SHA-2.  While drop-in replacement
   may be possible in some cases, others will require protocol re-design
   to accommodate significant differences in behavior between the new
   post-quantum algorithms and the classical algorithms that they are
   replacing.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-pquip-pqc-engineers-02"/>
        </reference>
        <reference anchor="I-D.ietf-pquip-pqt-hybrid-terminology">
          <front>
            <title>Terminology for Post-Quantum Traditional Hybrid Schemes</title>
            <author fullname="Florence D" initials="F." surname="D">
              <organization>UK National Cyber Security Centre</organization>
            </author>
            <date day="20" month="October" year="2023"/>
            <abstract>
              <t>   One aspect of the transition to post-quantum algorithms in
   cryptographic protocols is the development of hybrid schemes that
   incorporate both post-quantum and traditional asymmetric algorithms.
   This document defines terminology for such schemes.  It is intended
   to be used as a reference and, hopefully, to ensure consistency and
   clarity across different protocols, standards, and organisations.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-pquip-pqt-hybrid-terminology-01"/>
        </reference>
        <reference anchor="NIST.SP.800-208" target="https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-208.pdf">
          <front>
            <title>Recommendation for Stateful Hash-Based Signature Schemes</title>
            <author fullname="David A. Cooper" surname="Cooper">
              <organization>Information Technology Laboratory</organization>
            </author>
            <author fullname="Daniel C. Apon" surname="Apon">
              <organization>Information Technology Laboratory</organization>
            </author>
            <author fullname="Quynh H. Dang" surname="Dang">
              <organization>Information Technology Laboratory</organization>
            </author>
            <author fullname="Michael S. Davidson" surname="Davidson">
              <organization>Information Technology Laboratory</organization>
            </author>
            <author fullname="Morris J. Dworkin" surname="Dworkin">
              <organization>Information Technology Laboratory</organization>
            </author>
            <author fullname="Carl A. Miller" surname="Miller">
              <organization>Information Technology Laboratory</organization>
            </author>
            <author>
              <organization abbrev="NIST">National Institute of Standards and Technology</organization>
              <address>
                <postal>
                  <country>US</country>
                  <city>Gaithersburg</city>
                </postal>
              </address>
            </author>
            <date day="29" month="October" year="2020"/>
            <abstract>
              <t>This recommendation specifies two algorithms that can be used to generate a digital signature, both of which are stateful hash-based signature schemes: the Leighton-Micali Signature (LMS) system and the eXtended Merkle Signature Scheme (XMSS), along with their multi-tree variants, the Hierarchical Signature System (HSS) and multi-tree XMSS (XMSSMT).</t>
            </abstract>
          </front>
          <seriesInfo name="NIST Special Publications (General)" value="800-208"/>
          <seriesInfo name="DOI" value="10.6028/NIST.SP.800-208"/>
        </reference>
        <reference anchor="NIST.FIPS.186-5" target="https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-5.pdf">
          <front>
            <title>Digital Signature Standard (DSS)</title>
            <author fullname="Dustin Moody" surname="Moody">
              <organization>Information Technology Laboratory</organization>
            </author>
            <author>
              <organization>National Institute of Standards and Technology</organization>
              <address>
                <postal>
                  <country>US</country>
                  <city>Gaithersburg</city>
                </postal>
              </address>
            </author>
            <date year="2023"/>
          </front>
          <seriesInfo name="NIST Federal Information Processing Standards Publications" value="186-5"/>
          <seriesInfo name="DOI" value="10.6028/NIST.FIPS.186-5"/>
        </reference>
        <reference anchor="RFC8391">
          <front>
            <title>XMSS: eXtended Merkle Signature Scheme</title>
            <author fullname="A. Huelsing" initials="A." surname="Huelsing"/>
            <author fullname="D. Butin" initials="D." surname="Butin"/>
            <author fullname="S. Gazdag" initials="S." surname="Gazdag"/>
            <author fullname="J. Rijneveld" initials="J." surname="Rijneveld"/>
            <author fullname="A. Mohaisen" initials="A." surname="Mohaisen"/>
            <date month="May" year="2018"/>
            <abstract>
              <t>This note describes the eXtended Merkle Signature Scheme (XMSS), a hash-based digital signature system that is based on existing descriptions in scientific literature. This note specifies Winternitz One-Time Signature Plus (WOTS+), a one-time signature scheme; XMSS, a single-tree scheme; and XMSS^MT, a multi-tree variant of XMSS. Both XMSS and XMSS^MT use WOTS+ as a main building block. XMSS provides cryptographic digital signatures without relying on the conjectured hardness of mathematical problems. Instead, it is proven that it only relies on the properties of cryptographic hash functions. XMSS provides strong security guarantees and is even secure when the collision resistance of the underlying hash function is broken. It is suitable for compact implementations, is relatively simple to implement, and naturally resists side-channel attacks. Unlike most other signature systems, hash-based signatures can so far withstand known attacks using quantum computers.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8391"/>
          <seriesInfo name="DOI" value="10.17487/RFC8391"/>
        </reference>
        <reference anchor="RFC8554">
          <front>
            <title>Leighton-Micali Hash-Based Signatures</title>
            <author fullname="D. McGrew" initials="D." surname="McGrew"/>
            <author fullname="M. Curcio" initials="M." surname="Curcio"/>
            <author fullname="S. Fluhrer" initials="S." surname="Fluhrer"/>
            <date month="April" year="2019"/>
            <abstract>
              <t>This note describes a digital-signature system based on cryptographic hash functions, following the seminal work in this area of Lamport, Diffie, Winternitz, and Merkle, as adapted by Leighton and Micali in 1995. It specifies a one-time signature scheme and a general signature scheme. These systems provide asymmetric authentication without using large integer mathematics and can achieve a high security level. They are suitable for compact implementations, are relatively simple to implement, and are naturally resistant to side-channel attacks. Unlike many other signature systems, hash-based signatures would still be secure even if it proves feasible for an attacker to build a quantum computer.</t>
              <t>This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF. This has been reviewed by many researchers, both in the research group and outside of it. The Acknowledgements section lists many of them.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8554"/>
          <seriesInfo name="DOI" value="10.17487/RFC8554"/>
        </reference>
        <reference anchor="RFC6071">
          <front>
            <title>IP Security (IPsec) and Internet Key Exchange (IKE) Document Roadmap</title>
            <author fullname="S. Frankel" initials="S." surname="Frankel"/>
            <author fullname="S. Krishnan" initials="S." surname="Krishnan"/>
            <date month="February" year="2011"/>
            <abstract>
              <t>Over the past few years, the number of RFCs that define and use IPsec and Internet Key Exchange (IKE) has greatly proliferated. This is complicated by the fact that these RFCs originate from numerous IETF working groups: the original IPsec WG, its various spin-offs, and other WGs that use IPsec and/or IKE to protect their protocols' traffic.</t>
              <t>This document is a snapshot of IPsec- and IKE-related RFCs. It includes a brief description of each RFC, along with background information explaining the motivation and context of IPsec's outgrowths and extensions. It obsoletes RFC 2411, the previous "IP Security Document Roadmap."</t>
              <t>The obsoleted IPsec roadmap (RFC 2411) briefly described the interrelationship of the various classes of base IPsec documents. The major focus of RFC 2411 was to specify the recommended contents of documents specifying additional encryption and authentication algorithms. This document is not an Internet Standards Track specification; it is published for informational purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6071"/>
          <seriesInfo name="DOI" value="10.17487/RFC6071"/>
        </reference>
        <reference anchor="RFC8551">
          <front>
            <title>Secure/Multipurpose Internet Mail Extensions (S/MIME) Version 4.0 Message Specification</title>
            <author fullname="J. Schaad" initials="J." surname="Schaad"/>
            <author fullname="B. Ramsdell" initials="B." surname="Ramsdell"/>
            <author fullname="S. Turner" initials="S." surname="Turner"/>
            <date month="April" year="2019"/>
            <abstract>
              <t>This document defines Secure/Multipurpose Internet Mail Extensions (S/MIME) version 4.0. S/MIME provides a consistent way to send and receive secure MIME data. Digital signatures provide authentication, message integrity, and non-repudiation with proof of origin. Encryption provides data confidentiality. Compression can be used to reduce data size. This document obsoletes RFC 5751.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8551"/>
          <seriesInfo name="DOI" value="10.17487/RFC8551"/>
        </reference>
        <reference anchor="I-D.ounsworth-pq-composite-sigs">
          <front>
            <title>Composite Signatures For Use In Internet PKI</title>
            <author fullname="Mike Ounsworth" initials="M." surname="Ounsworth">
              <organization>Entrust Limited</organization>
            </author>
            <author fullname="John Gray" initials="J." surname="Gray">
              <organization>Entrust Limited</organization>
            </author>
            <author fullname="Massimiliano Pala" initials="M." surname="Pala">
              <organization>CableLabs</organization>
            </author>
            <date day="29" month="May" year="2023"/>
            <abstract>
              <t>   The migration to post-quantum cryptography is unique in the history
   of modern digital cryptography in that neither the old outgoing nor
   the new incoming algorithms are fully trusted to protect data for the
   required data lifetimes.  The outgoing algorithms, such as RSA and
   elliptic curve, may fall to quantum cryptanalysis, while the incoming
   post-quantum algorithms face uncertainty about both the underlying
   mathematics as well as hardware and software implementations that
   have not had sufficient maturing time to rule out classical
   cryptanalytic attacks and implementation bugs.

   Cautious implementers may wish to layer cryptographic algorithms such
   that an attacker would need to break all of them in order to
   compromise the data being protected using either a Post-Quantum /
   Traditional Hybrid, Post-Quantum / Post-Quantum Hybrid, or
   combinations thereof.  This document, and its companions, defines a
   specific instantiation of hybrid paradigm called "composite" where
   multiple cryptographic algorithms are combined to form a single key,
   signature, or key encapsulation mechanism (KEM) such that they can be
   treated as a single atomic object at the protocol level.

   This document defines the structures CompositeSignatureValue, and
   CompositeSignatureParams, which are sequences of the respective
   structure for each component algorithm.  The explicit variant is
   defined which allows for a set of signature algorithm identifier OIDs
   to be registered together as an explicit composite signature
   algorithm and assigned an OID.

   This document is intended to be coupled with corresponding documents
   that define the structure and semantics of composite public and
   private keys and encryption [I-D.ounsworth-pq-composite-keys],
   however may also be used with non-composite keys, such as when a
   protocol combines multiple certificates into a single cryptographic
   operation.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ounsworth-pq-composite-sigs-09"/>
        </reference>
        <reference anchor="I-D.bonnell-lamps-chameleon-certs">
          <front>
            <title>A Mechanism for Encoding Differences in Paired Certificates</title>
            <author fullname="Corey Bonnell" initials="C." surname="Bonnell">
              <organization>DigiCert</organization>
            </author>
            <author fullname="John Gray" initials="J." surname="Gray">
              <organization>Entrust</organization>
            </author>
            <author fullname="D. Hook" initials="D." surname="Hook">
              <organization>KeyFactor</organization>
            </author>
            <author fullname="Tomofumi Okubo" initials="T." surname="Okubo">
              <organization>DigiCert</organization>
            </author>
            <author fullname="Mike Ounsworth" initials="M." surname="Ounsworth">
              <organization>Entrust</organization>
            </author>
            <date day="21" month="September" year="2023"/>
            <abstract>
              <t>   This document specifies a method to efficiently convey the
   differences between two certificates in an X.509 version 3 extension.
   This method allows a relying party to extract information sufficient
   to construct the paired certificate and perform certification path
   validation using the constructed certificate.  In particular, this
   method is especially useful as part of a key or signature algorithm
   migration, where subjects may be issued multiple certificates
   containing different public keys or signed with different CA private
   keys or signature algorithms.  This method does not require any
   changes to the certification path validation algorithm as described
   in RFC 5280.  Additionally, this method does not violate the
   constraints of serial number uniqueness for certificates issued by a
   single certification authority.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-bonnell-lamps-chameleon-certs-02"/>
        </reference>
        <reference anchor="I-D.ietf-lamps-cert-binding-for-multi-auth">
          <front>
            <title>Related Certificates for Use in Multiple Authentications within a Protocol</title>
            <author fullname="Alison Becker" initials="A." surname="Becker">
              <organization>National Security Agency</organization>
            </author>
            <author fullname="Rebecca Guthrie" initials="R." surname="Guthrie">
              <organization>National Security Agency</organization>
            </author>
            <author fullname="Michael J. Jenkins" initials="M. J." surname="Jenkins">
              <organization>National Security Agency</organization>
            </author>
            <date day="26" month="June" year="2023"/>
            <abstract>
              <t>   This document defines a new CSR attribute, relatedCertRequest, and a
   new X.509 certificate extension, RelatedCertificate.  The use of the
   relatedCertRequest attribute in a CSR and the inclusion of the
   RelatedCertificate extension in the resulting certificate together
   provide additional assurance that two certificates each belong to the
   same end entity.  This mechanism is particularly useful in the
   context of non-composite hybrid authentication, which enables users
   to employ the same certificates in hybrid authentication as in
   authentication done with only traditional or post-quantum algorithms.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-lamps-cert-binding-for-multi-auth-01"/>
        </reference>
        <reference anchor="NIST.FIPS.205" target="https://csrc.nist.gov/pubs/fips/205/ipd">
          <front>
            <title>Stateless Hash-Based Digital Signature Standard</title>
            <author>
              <organization>National Institute of Standards and Technology (NIST)</organization>
            </author>
            <date year="2023"/>
          </front>
          <seriesInfo name="NIST" value="FIPS 205 (Initial Public Draft)"/>
        </reference>
        <reference anchor="X.509">
          <front>
            <title>Information technology – Open Systems Interconnection – The Directory: Public-key and attribute certificate frameworks</title>
            <author>
              <organization>International Telecommunications Union</organization>
            </author>
            <date year="2019"/>
          </front>
          <seriesInfo name="ITU-T" value="Recommendation X.509"/>
        </reference>
        <reference anchor="ANSI_ASHRAE.Standard.135-2016" target="https://webstore.ansi.org/standards/ashrae/ansiashraestandard1352016">
          <front>
            <title>BACnetTM A Data Communication Protocol For Building Automation And Control Network</title>
            <author>
              <organization>American National Standards Institute (ANSI)</organization>
            </author>
            <date year="2016"/>
          </front>
          <seriesInfo name="ANSI" value="Standard 135-2016"/>
        </reference>
        <reference anchor="Addendum.bj.to.ANSI_ASHRAE.Standard.135-2016" target="https://www.ashrae.org/File%20Library/Technical%20Resources/Standards%20and%20Guidelines/Standards%20Addenda/135_2016_bj_20191118.pdf">
          <front>
            <title>Addendum bj to BACnetTM A Data Communication Protocol For Building Automation And Control Network</title>
            <author>
              <organization>American National Standards Institute (ANSI)</organization>
            </author>
            <date year="2016"/>
          </front>
          <seriesInfo name="ANSI" value="Addendum bj to Standard 135-2016"/>
        </reference>
      </references>
    </references>
    <?line 330?>

<section anchor="appendix-1-post-quantum-migration-properties">
      <name>Appendix 1 - post-quantum migration properties</name>
      <t>The purpose of this section is to define a set of properties that can be used to classify each of the use-cases listed in a consistent way <xref target="sec-usecases"/>. The goal is to make the document a resource to help classify use cases which are not covered herein because, for example, implementors could classify their own use-case and then find one in this document with the same properties / classification.</t>
      <section anchor="active-negotiation">
        <name>Active Negotiation</name>
        <t>TBD</t>
        <t>Protocols with existing mechanisms for real-time cryptographic negotiation such as TLS and IKE already contain mechanisms for upgraded clients to downgrade the cryptography in a given session in order to communicate with a legacy peer. These protocols provide the easiest migration path as these mechanisms should be used to bridge across traditional and post-quantum cryptography.</t>
      </section>
      <section anchor="passive-negotiation">
        <name>Passive Negotiation</name>
        <t>TBD</t>
        <t>Protocols with existing mechanisms for non-real-time or asynchronous cryptographic negotiation. For example a PKI end entity who publishes multiple encryption certificates for themselves, each containing a public key for a different algorithm, or code signing object carrying multiple signatures on different algorithms.</t>
      </section>
      <section anchor="non-agile">
        <name>Non Agile</name>
        <t>TBD</t>
        <t>Non-agile or flag day implies no graceful migration is possible; the community decides that as of a certain date legacy clients will no longer be able to interoperate with upgraded clients.</t>
      </section>
    </section>
    <section anchor="appendix-2-composite-signature-individual-and-organization-position-statements">
      <name>Appendix 2 - Composite Signature individual and organization position statements</name>
      <section anchor="bsi-stavros-kousidis">
        <name>BSI - Stavros Kousidis</name>
        <t>"from a strategic point of view we don’t want to replace our current RSA algorithm with standalone Dilithium since: If Dilithium does not withstand cryptanalysis in the future then all our efforts are for nothing. With a composite signature Dilithium+ECDSA in AND-mode we can buy ourselves some time in case the Dilithium security guarantees do not withstand future cryptanalysis."</t>
      </section>
      <section anchor="google">
        <name>Google</name>
        <t>Relying on a hybrid signature is critical as the security of Dilithium and other recently standardized quantum resistant algorithms haven’t yet stood the test of time and recent attacks on Rainbow (another quantum resilient algorithm) demonstrate the need for caution. This cautiousness is particularly warranted for security keys as most can’t be upgraded – although we are working toward it for OpenSK. The hybrid approach is also used in other post-quantum efforts like Chrome’s support for TLS.
TODO: How to reference this page:  https://security.googleblog.com/2023/08/toward-quantum-resilient-security-keys.html?m=1</t>
      </section>
      <section anchor="entrust">
        <name>Entrust</name>
        <t>During the transition to post-quantum cryptography, there will be uncertainty as to the strength of cryptographic algorithms; we will no longer fully trust traditional cryptography such as RSA, Diffie-Hellman, DSA and their elliptic curve variants, but we will also not fully trust their post-quantum replacements until they have had sufficient scrutiny and time to discover and fix implementation bugs. Unlike previous cryptographic algorithm migrations, the choice of when to migrate and which algorithms to migrate to, is not so clear.  Even after the migration period, it may be advantageous for an entity's cryptographic identity to be composed of multiple public-key algorithms.</t>
        <t>Entrust will support composite signatures in PKI infrastructure.</t>
      </section>
      <section anchor="charter-robert-hulshof">
        <name>Charter - Robert Hulshof</name>
        <t>"The rationale behind combined keys is that I can see an important use-case for very sensitive data (government, financial or other high value data) to combine multiple (PQ) key algorithms, and that this migration to PQ is a good time to start supporting that by default in the crypto libraries.
Trying to estimate the probability that a NIST standardized Crypto algorithm gets broken in the next 5-10 years is very difficult. However I assume that everybody agrees that this probability is definitely not zero. Personally I would put that probability somewhere in the range of 0.1% – 1%.
If I were the government/bank etc. I would not like to have a 1% risk that all my secrets get exposed. Adding one or two more PQ algorithms would reduce that probability to 1 in a million or 1 in a Billion would be much more acceptable."</t>
      </section>
      <section anchor="mtg-falko-strenzke">
        <name>MTG - Falko Strenzke</name>
        <t>"Without hybrid signatures, a decision to move away from traditional signatures to Dilithium (or other non-hash-based signatures) has a certain risk to make things worse and I think many decision makers will not be ready to take the responsibility for it until the quantum computer threat becomes imminent.
- If composite signature is not standardised, non-composite hybrids would be left. This implies protocol changes which will:</t>
        <ul spacing="normal">
          <li>
            <t>need more discussion,</t>
          </li>
          <li>
            <t>need more changes to existing applications,</t>
          </li>
          <li>
            <t>and thus be more bug prone.</t>
          </li>
          <li>
            <t>Not having hybrid signatures at all will likely cause many decision makers to
            </t>
            <ul spacing="normal">
              <li>
                <t>use hash-based schemes where possible / affordable</t>
              </li>
              <li>
                <t>and elsewhere stick to traditional schemes as long as possible, thus effectively delaying the migration to PQC."</t>
              </li>
            </ul>
          </li>
        </ul>
      </section>
      <section anchor="transmute-orie-steele">
        <name>Transmute - Orie Steele</name>
        <t>TODO but something about this:  There are use cases for long lived verifiable credentials, and attribute cert like stuff we work on in supply chain, with DHS / CBP.</t>
      </section>
      <section anchor="crystals-dilithium-design-team">
        <name>CRYSTALS-Dilithium design team</name>
        <ul spacing="normal">
          <li>
            <t>https://pq-crystals.org/dilithium/ (accessed: 2023-08-21):
“For users who are interested in using Dilithium, we recommend the following:</t>
          </li>
          <li>
            <t>Use Dilithium in a so-called hybrid mode in combination with an established "pre-quantum" signature scheme.”</t>
          </li>
        </ul>
      </section>
      <section anchor="hybrid-post-quantum-signatures-in-hardware-security-keys">
        <name>Hybrid Post-Quantum Signatures in Hardware Security Keys</name>
        <t>https://storage.googleapis.com/pub-tools-public-publication-data/pdf/8becef5ac3da51c3b2e36d2dbcd18a4bd3d220d9.pdf</t>
        <t>“A hybrid signature scheme combines a classical signature algorithm with a post-quantum secure signature algorithm. Before discussing the design of our hybrid scheme, we explain why such an approach is relevant instead of simply replacing classically secure schemes with post-quantum secure schemes. We present the assumptions below:</t>
        <ol spacing="normal" type="1"><li>
            <t>Cryptographically-Relevant Quantum Computers (i.e. with enough qubits to break ECDSA) are not available yet.</t>
          </li>
          <li>
            <t>Classical signature algorithms withstands attacks from classical computers.</t>
          </li>
          <li>
            <t>The post-quantum secure signature algorithm might be breakable by classical computers due to design or implementation bugs. If any of these assumptions fails, using a hybrid approach instead of replacing classical schemes with post-quantum schemes indeed does not add any security. We believe that all of these assumptions are currently correct. The third assumption is motivated by a newly discovered attack against Rainbow, one of the NIST standardization finalists.</t>
          </li>
        </ol>
        <t>We can now discuss the informal requirements a hybrid scheme H should satisfy:
1. If a quantum computer becomes available, and hence H’s underlying classical scheme is broken, H should maintain the security of its underlying post-quantum scheme.
2. If a classical attack for H’s underlying post-quantum secure scheme is discovered, H should maintain the security of its underlying classical scheme."</t>
      </section>
    </section>
    <section numbered="false" anchor="Acknowledgements">
      <name>Acknowledgements</name>
      <t>This draft would not be possible without the support of a great number of contributors.   We thank Stavros Kousidis, Robert Hulshof, Falko Strenzke and Orie Steele for allowing us to use their statements regarding composite signatures.
TBD.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+19624bSZbmfz5FrgqNknZI6uJL2eqZ7pYluawty1aZctc0
FotGkhkks5TMZGVkimYZBvod9tcCM8A+yz5KP8me75wTlyQp1wUDbO2gf5SL
SmZGRpw4l+/cgoPBoGebtMz+mhZVaU6Tpm5NL1/W/Mk2J0dHz49OepO0OU3y
clr1bDte5NbmVdmsl3T/1eXty15am/Q02RuZSVvnzXqvt6rqu1ldtUu6elPZ
ZvBtm5ZNu0jeW5NclclNXTXVpCrsXu/elK057SXJz7w/SeTFe9/RO/JylnyN
53B9keYFXV/+MPlTbprpsKpnuJzWkzldnjfN0p4eHuIuXMrvzdDddogLh+O6
WllzSM8f4rlZ3szbMT2Z3qd5nX71FX0zwBOD1ppJag1uKtLG2CYa3t08lMeH
ebX52GFWp9NmwPcNlj+0+ZL+xZcDfGuH82ZR7PV6WTUp0wUtdNftk3D/4Oio
12vypqBbmXQ/KOkm9XrZVLM6Xc7XCd2e8O29dDyuzT3d++15dLVIy9lpYsre
3Qp7MUiWDw3F33YfTttmXtWnvUEiMz4rm6rMq+TPmDPdTxQ+TUa5WZjSYkN0
BuGKbWpjiIrfmbo09eC+Kgf65WDU1KmlNx3TbZMqo9G/fHb06NGjL/E38dpp
ct2W+WTOX7dlU9OVr029SEvM1AhPpDKhIRPxT1aGHk6qBd1CHHuauN1brVbD
+Gu3olemzOr8LnlRV5O7edra38Kq5jKp4dhN6tes7KwwH0j8TZ28o0FNWv4W
Vpa6SQ1rmdSvWdl/q+YlKYd07VZ0WbJKi1YUrrgVHR8/+yq5Seu75KZIJ4a+
qc2MlB1N+01Y0ZMnj756Hq0oL0uTLqsit/Gy3pd5Y7Jk1EBHJNU0OVuYOp+k
YZ3f0xSHJFbrPxmZyUPri79267vO70zyti0tKdtm/ttd5ILmOazcPH/JSntl
RYzRkKY+7fVgffxfCdmdy8vhs6OT4fHZu8HJ0fGz0+Ti7dXw+Gh4fHz0/BBf
j24vhvhm+OzxCS3lMT317uX54+ePn5+6j8+f6ccnJ8+O3MenT07049PHJ8f6
8avHT929zx4/fqofnx8d82BXgws2JpGCNuUsL42p7c7vm8F8Pa7zbNAQ7+dl
VVSzNW58czW6HY5uaGVHtKpn/tLLq5vR8PjZ08ETN4lHz93Unj158thN+Oir
6OrxxoowC78RMDpEZNLztIEDm8/8RMcV7XRRDIp0sbSDyZy4rTAk4hNTN93V
6B10fTDOy4ys8YA2abBoiyYfwCp0539yxLMnC57WMzCi2/iJrSfDMqdtn1X3
h8t2bA+n+dIe0gOH+TKTZ8TE/YH/SIThCmNt8iq188ELMkRZcpGT1U0L0lSz
Mm3a2uC2MktrGcLZKRmBxeUNMVRV0iNXpaU3tI0BD7unLFmOLLk1k7nsULKP
xRzwABm9/zQ5OTp5xH9a4npjwaRufNx6mmDhdNeTZP+KJCWnN9204yKfJBcw
6xjqX4dPjp6f7lrjlWP5qkyaMIm//+1/Jm+XpkxGa9uYhaX7iIsm2LUJ34sb
bueGyFHTlQpiKi8d3Jk1LyltmjofY7XYvHxKAkufpzVtNaCbfYhc/KbS0eyW
NoBYaAGFztcs1EFVduhz/PwB+lzdvh8Qgd7xEGTKZJ1MDbrj7M3o6vBs9Ord
2eXQbcfw+NETyPrT3Vy0MmNLqzXDtLQ5wzrr9vGQeKROzSG+kY/uKxoSI+4i
/4uz89I0t9fJWXKRNmlyHi/VQ9LkZVUnL9q8APsnZ21T6Y6dEZ3PCSbXdM8b
04CuD5FVdWYZ2DFwYGDMfdCky3w68W3i4tZTP0riCAfCZhkRu10Mx98Pm2r4
a+hMalqIyER+SRb6dydHr/NxndbrQ5YWWkxB194ZW7X1xNhDvx66Sp/o36/b
PDMFqcjulzK99JCm8FdM4a/j7/H/58dktIbLbLpro9ySkvH3SVP9J9i3jQVt
b2NvMBiQgSeDnk6aXu92ntuEHIaW5KhJpvTBwhiT1iAtMCGXDPuRkCYvCjJL
rOIWOeGOBksnv2/GZoimI/5bAgRXi0CvyI0JX9SG7FcNrNXYxC7TssQI1T3B
xzTJyL3JTJ+8CNgVGgPfsTzHWsb2yZGcFC2TnShKWLGZpw1ocW/ozeTGle2U
lkXqu07I1WxJscfPkya9MPdXFwf9hKxWSd9O83qxIh/00FbTBh/6rOQqWn2d
QEfRXtL+kydIg9DIdkjIlWZxT1ogn0HzpUmddglDxAN1GwJGmLJdmglPoCjW
iZjuroOFF4LaU5PafJwXoBaNZmGmpm0RWylvnWgpr16MDhI7mRNJO4TJib7L
uhIDRKqdpnxb0YBTpjToWxvC/5bQEL5uzIemn6wMPWMseCBNCKc1mIF304iI
0N40gZQ8ZhqWN76gEbJdO99PQO1ZVec/YofMQohq7tOiBclwKUlnaU58ziu/
T+u8au1OAiYk6yV20GRM+7SwVZLmNEDDE8WSO8vFRKpJngJbMguadDJPFoYY
JhsK+y/yLCtMr/cFrFJdZS0bPwgDkaGtl+AsWn/TkQ36TAIF+pHWiqhUm7QY
kKgXWSBYXySJObz8vJjQ7nRek2ZZLhqB2IXWabFQJR2Nh5FrWZJ7G1GXBm4e
5sACcH8H58Vcw8BriYUxGRXcsZgIw/Uf4lNZ5me5dZNZo/XwiN39ozF5femS
rtOHoWxMvBG0upbFPKMl0K7wtKqiqFY8FwEz1kWEXCxiF3X2+ryRFlELWhUR
INzlJmDs75O990ptmmNRyAvo2cxYUpJjJg9EZ57P5klh7k3R50kFEaKv57TE
mOak/VPa57XNrbDbJiX8Vuu3O+WDZkn4LKWpE6G++IJQUaRoX5NuatOZERIC
wxGnkonZu34/uqX58/+TN2/587vLb99fvbu8wOfRq7PXr/2Hnt4xevX2/euL
8Ck8ef72+vryzYU8TFeTzqXe3vXZX/aEhfbe3txevX1z9nqPSLEhY6SAIWRj
qFgSGFJJkOLU9hydsd/Ji/Ob//O/jx8nHz/+F3JRTo6Pn3/6pH88O/7qMf2x
IgWnmrwkMZI/iYLrHlHLpDVGIQGjrVkC9WP3iKnm1apMSPGDkP/1v4My/+M0
+efxZHn8+A96AQvuXHQ061xkmm1f2XpYiLjj0o7XeGp2rm9Qujvfs790/nZ0
jy7+8x8Bo5LB8bM//qHH3EMYhzhpIU4S9kQ4h9iNLIa4E9XDET58A5ZMMtbM
k4aNjAcPucCKjPASfYS+qjJyCuhucb7ioVQvkvFsizxlpSkuy7SuFjwMgRjC
C6ypobAKA9OCCADeMyYTzndVbTOrRNrAPHQn/ojeBOtewFg18wVMF2kW+Fos
e6UldU23ZwCDXnk3c7KCszmNjDfktcM2ZBfzqQG2cVpdBHsJ9EDLIL6DPmUw
gInTNEk4ibKNMU4V+pfQc5GVdRSK9fGKpj5nkYGw0FoK7A0PQOMonknaJZAj
xP5uSvpRtMtPASWSh0UF48U4SDWMmqsLWiFMwzy9x6ThqxKMIj3GahRke4g9
iNJ+/l2aV0SOusRu1xZmtTYzAq1KEyLwtgUdJmeNgyx9kfLPmyA1PkwvKFeC
FbWDLyTwZ4JELLmx5CMsyKjSHGjL4AMTM2XQtPu3by/ensJC05cEp8B99gDE
zBTWMIMRflAtjb1/mBbsl+c/tM62EjvYauERxE6DnUK42CqxaNH6l7QWVpp4
vXsRcahJG6IR819ZrcQaLWgyiSEkKE9HRgTbFmScCV/hPTTHRvkwFay1zYlJ
OiGrRVqcxqwtbB4ZHKK3KQHrLE2Sxb3FHjf0SczUaFIt1SxZfPyFgAuSFgPU
eQp/xgByZsl4vQtzxR5ILD3Neqno3GkqXb+IjiKuDylUDNFSfBZWQMSZKl4L
2su0zO1CGAypnIJNMqIpNqZGaYhpiMzsO5Rk3mt6cY6xMbGf5Jv1ThAwhNtp
aX00REFsssjZO8FN0cwW0I1iWxn0GkIjM9o00cpFvuB4rPmwhG8JBcXw+eGZ
EImw+GHysq2hKBYV/Kecd47WCNguOsnJmwaL6aIKF/uJ7MMt0nVHkFqB4Lv8
JciJ+lQJXAjoUitMdRtCopuu7SK9Iz5pHbKnt4R7CcaRBhNw8fGjRno/ferL
Hwjw+j8QtsUf9NfnIrdy/8+K3RJc4VBhrFsc42+AcEno8Vq7CbtrzxOjrkxD
/xE393o3pmJ0H2k/cLlIgY8QirMPbbxshJNtS6wKWAzTUhX3xsFURglEytRZ
nMCXbKEnBdz4yYZVxzCel2iBLRGClO7UPGiRSYmxf2jEJgZMztMbG9FJlrwt
Cw/xquw6A+zarqq2yMQNArqkwaYQOicGIsxh4JaTWjooOwKlanynZ6F3jVPB
BPdpQZ7ThPBTEQniLFJ5BW0ZYkZpMjOlgaHOI7+Tp8hurX/HTzGXqtCOwRtv
GLyRGDxRsWwgA1FF5hB+GnetIXbCeeZp06STO43jbG6aC++0UxLDHAKm2h34
qMpImlm1Qru7Wc7DLO1uz5DWvZHFYGC/kcaga/96PRqJPCKZoRL0+tpde/Lk
MWh0NiFjnKkyxyBsBW00JXp5TBUJkoxNA64kLcgx9JIZJC3lKckbdB4LnjEz
TrHmN4agO2mhiMQrQ34H32ibqiKOTa5JbbJNeWham5Bl1yaRydveorEg1KSg
WzSkJNFAsrcawiOmJzvAZhxsSy4QiEWrZhvOVko0Z5pVS5ZusrRIryaXrITZ
bjJ6cOBV9BWHPqYCnGNm07hbbcgNI2tDD2sIkP4Vqw3C51XGapqAGBN3xcG+
CHI4U+ZU09i9nAa8JyiahfCPh3VLyZ6QE9zvkjqryKw3ibqGOprqvQDkx2aS
thxyNLUq0rau2eDCDAVBIDXZimVzdKHVIlvKdkitD6jI+NzDE/KF2kJMVMaL
xtOkhAh3seWcVEwiqfToBQUQMlkPaoBYhE6OIEBqQI3lyVy/Hoxev0r2Rzev
rt6cj/7pIHAf8ecVG/Q04v+dkuwfETBrfxXL0uugrtIMKjWdBVQYRs9Ve3nd
4q1RDqzJRgoxA3a7HLnj9byqVoZIKZCYzGVmSO79sGFBlrCkCB/5UgZWIKnA
+uy4psTiTZtBtuoZ40H6mtUS7RppIl5IbhXXkOHJiAeqtbo01nTUTsm0oqkw
CMnMfT5B4LOUSJsL7Pj0wzu6ge3S/nnHaJ7NOCh3kHz8Yumqnj71enqZcZNj
Nv+9uIO0qSC25AwRs26BjW1ydZO4yqxk/+qGHj/gBySZZ5rkG7NOLj8AYdLj
+1ffXB6ICkY2GRjoFj4F+UNN8jpdE5nCaLevRweirR8/fopb+StzeM2BSA3C
+vdckxGlFzWIW0Oy9keH11fXlwdO3/PLcghPyxopKFgsg4MO6zJdEJGc56YK
qsMcVoW/ZShxxkgIIahtzL0WZkkLdqkxiPmgwWgW3ZY56CFME72GuAyh17Q0
VWtp4pkEHNI44qIKMVoe1FUnJLYBSnz2kjjnjJwMRzi3Yj9Zf6NiJJoVQYyM
BqUpalhBEbkPcqSenxQN+dG6XKXcFDQouXAVSyS5oGAJKDg3gfxHjblCd3S8
IXoUKJPUDdFw2pYTiY7TDAKf+uh1HB8xw9kQ4dakKyXXyuyjNb3gA8nQ9UiZ
FsUOykdsDwryNLN17My9aBGLJ12gJOeAMLL+zI08eRquz3mWWpzzTAkzJaIh
O4PgdU4QQPzAtBY3SvdS7C889e0FRcFRYZw4r+QsjWdUURnXbpiQOOr1RtB+
XQ9+nt53UTDbbjhFwowk+BVy/4Xm8O9jpwSxVE1aOHy8rPMFlta5SR0H0WGA
yMwfzhNXfNA4hRH4evsZhvmb75TpNhGX75yuqP0oR+TQSsd+9ZnpfGR966GA
JRLG9T4exHLTCD5hTO/WRN/X0CrwAySzGY3Rjb01Ki8dr5SfIVSboHiVpQmj
s55bpcIAEq37nBCG7SUWKNKlDRDJUzk8FekN/2BH63z8GOzMJ1E1Mc39QxLJ
QXI3M4GbuhzkrsZVJZgKqoNAUZflyWtEgUoD+BDRXQirURog8s2YCvgrI4mh
GQhyoWucKq1oEzhFwNRjRym8KJ5NALmYJ/3FMeZOftnOnRZlEcWmIPePSIjE
T32sRAm5FA3nUY6jmErDlLOtRJ4zUlsax+FRL0FLcO1FPnWRSNx3k7KKPo8n
Jc7kZ0uz1IN6Zwrm7s7jeB2SXzS6VydnnUUJF/EmeowSebA/Werl/NlzH/GI
1RXw4KwifaVx/s3EpHKXCAv4yLNVNf4e4ctIZzK3p+V6t05pOB8OkJo0q6rz
CmZQmjlCKE0FHKG3CvRrRIOODZkGcfFBRsmMYqhMd6n5TJgjXmeXGR5coIqp
KFC1z1bZUqeXxcsQSpDoazpdoiU0PGmQfjf9QK9egguMT02GgE6E+WEUStE7
4SoTBIZO3EFk3xT0S2w23Q4BcabCfk7n894h5aJ5B1pLmqVL9gMWxD9XDp2L
KYzpJ8sO2py3sx7nDaqOduvLvpZKCLNBRTuPM1LKmxZoB3cSioyDENt26oFU
e3RdzYS4YA+woNxtxGkmfgumRRkrMl3RyHV+n+rydgwff+22tPMiuE94WbjP
OmPu0Y9b9casIv50UGpzwXTbUIO4GpEUmxjZn10Kg+2A9n549+HmmyvVSJ8p
YiUlSGMiiK1RO46zvg85Bp/4JweLeNt1ZcDHurx48/b28vkpEzu6sVNF4yXU
BQcN8Y9boxYtiB+KMertlIgauW7xR6d0B5TKgUlJyO9zs3L75G4XifWplGXV
aJR+d1bBv27bAeIXo9yhoP/EG/deu4gSYhfhijjXDbnpEh6OgtBRBY14yRwo
8SkTMQ5XZUYSWOccoI6r8oL87vM7OAZE19FehBJmexAgb/6Tg/Q5IhAqcMAq
1YxzFsTJ5A+XUtcH77xOfR1KnzUYjTKrkd25xxwkNi0Jokyianc+seFDcQ8O
iSaNifHL8Q+EgJHP7GiJT5ynIvc6OR4+SiIXW+toxq5wMQ2Fi0qX9XaWhAN4
u2mVfLmrBjLdroG0yaF69/gGpcZfJvtSank4Oofz9dlSUoBeuZvsVEDFYzOF
jBw/f/6kLzYG8709vzkkkvo5Io5n+DnktaTqDVNkB885duKJLpD8q334BYtm
0uyimJsRzZ9NpZY9lCRxoBi5endJwREPjZpqkuuOpR8RYCExtknMZJZ8Z8aj
imwkwxAtyHbAHQOHN+5+RStzuM/rpiV2nbfjAa10QGqY8x5LiUavOHzJth5f
iFu589Wh0qIk3G6dJkdrmnASp3WnRvUurSbMkAY97fUG7ArFLOVfZP2y7/PU
cWtfHyGez6UKdbsGlA1/gJ8mmqBaEhUnHuzizYh8alJ2aHyR6GDr2fTi1fmN
JrmW4nK6CcAazkp6Dml6FnuktiXydHVz/xiwhP7/9MA9oHj9zdktjULk8ZT4
0m46ImmGHRCPyCLGnNs5mzMVwRCSiaCGV2bDZBT7/Vgvic8vKMwmKxeKFyTX
pD0qCH2wHHnHXzJpjL5oDmLaNXXAGrGzL2kZfOnzs8gV4hwtiRZcLocGuC5c
RQ2lccR203zWqo1B3F95LK6HwZMdsWMR56IIzqqkzIQ2X6BNM9b1kXYPrLVD
Q/YluM96Bbvm/ZvPJuQleFJtpNLiGiS8CsV/dg4LoLUe+GIHe3vHkS1q13ns
9TqZdonKhUR6hHBdZK4kbVCVbE871BuQbR0XcbDZ6s7K1BG2jisVBENoQD4N
+fdduEDibp9P4rNN/yIZuexyGCdYNZKsHfGrZKAlFSpyTC9aLgoZttZM9+dF
7uIyPAFfcenSEJy86yTAGbVMtILSpX2Un9NQFD8m3HJH+7pcanWhhga6gS/3
HCLFEhDwXgOyW7jSLmfIQqiArRAdpIURS09QDhRVaFRqgX22wAd2JHqrAHPD
ySykvUKRiI3FxZtJLllNJI7PWkFV4q5A5BBNBh4hccFH9/VSCBUS3CyV3rGU
eAu0OJME7yLXbjLXSnDO3fkqAgR6IsdSuJr9TY7QSazaFdksqkzESMpKXCjS
y74IXndeodxaZgblwDsAgEC7gAwMUucNvBVm1az1E+EiVYKspHyRURAjuJFa
YXTMG8kFwuRZ1LlLBPLzLHZaTm1CTpVrqga09VlVb904JNnY6fwM6A9Rf8Cb
O4LISAlDuDnO5TbMcYbzY3ewT95lnHRn4k+LofIITw81fQiAilXtCuD41AOI
LQUQ4gdwVa74pK79bDO6Y0PoQMQHrlQgwUpiM5Y8FTR4qdXkOE0b14sE/8iV
aTdBrMbC0mMy18k0b/peJ2xxflltMCFv8pYdiqvPXEpH0uqh7ExLPLplnL3b
Fxd8/aX2rbjr6oA+Egd02v027hTQSoXN8lCSs35syEL5ikAQFp3G+kDWxCcN
+PYF1Bd7zpPCpDUMlU6h/2BtFaMQX+LHUSD2n9KFuo9cc4uuPH7WJcz7Ub0e
XUaKZsDMvDAL1Gruv3t7fQB8poMtWGi3b7vBfU5zbL845d0sB7KdKvjsrZoP
pMqkbofrRaQRajUQFerz+hPxgYZwPtn12dgULevYWW0ssCg0i7iOG65n9ACs
H6uLvIwYTfbZG6oNv3KamyLjCkjDoQ51d6TChd4mKUSuPuC2LGBO5NncvH2T
FsE4eyei7fUq5g9nRQqxyYzOq1rIKlbuM8XXqMYX/caxB5+mDw8aroCQGX9p
A4HiB0kBlF8i97JK1zZxGXSntWttKyQKTRjdiD5VgsFR6NjWEfT2nmUEv+dJ
xeCIzIOzkfahDeYEcSQMna0PbBy7MxwghYS+rfMZqqqTSxSAscW4jqu2999e
Ep+PwdCpKJq0U5vri3us5Vrpbm9KKnrH3YGONtRNcOjRr4P9Xumuq/tRlNmg
0LsTh4apTv1r8UQ+kdrXzYt9LaZARQiK312RdzTnKChZOtpGoE4Z7pUTNF9S
cK0FNPuvRtf2AAqGJldaP7paqynHmyNgrRPQlUFg23FUS9vEChXBuNxqB7QE
N2NXxtcVA9/TyyVq7AqSukNFU3KFMcktS80ZS02yf3smCiq5PXNoN93hEmPP
4tomTkiiREeYgoR1nJe+sBhOCZQyQIv2pzG7XV7HEkVMZRnrsRdmg5rocq6Y
aVXQiAWunUOCQuJoz/qiqxeV5NHIA7Cu5jqqfHEA16pu0hI8CaMxRmZHJSrT
5tXmpQZYQ2yDRRnBV687cka7cxL4RsJzmK+QN18s2iYNHW1NZ8WgvMvkIqQq
xUVRO4hGQNgP5eAF+GPCqUUXXRVfI7nnnvrtDkVEawf01kGoKLfONMWEp/VL
+ZzksaRcLnbIXf8Ju3A5YIxKm+u3tRoI9Zr9TSUOmMYNxYNuOdEr7/XanuM5
fzbE3gUDTUv7Z6ROwMdsaTPu5Q4UrKHDCoABvS9QzfT8CCVkRGcegdDSl2Ri
AQe/dPoBltpWQNpr35KH51gJiSFx4VI3wwEK8Qcz+GG04ALhpWyQoZfr4pwY
b2acqRGWDeJL434N0ouvuGElcY7RijTFjFxXGqVsGdnoRauxHON0M9niZgJU
Plqg6mxhuP5y4Ew5TSZodgIPzGlM13Ld70iRU39zsjw2DDjhgBBOZ9iZWJbs
EsdaXdEM5841cGlZTKJ2Zl8Vr1qXX+T4+ba6IyjCL3P1NS+vLt6e9EnwTLr0
dOeQJk2nVo8pqAUYx2XacOvmT7v5X0cOLlfOEsjpdItr6CcuhaHFdXXIlgrp
dyxUlFu0G9Zks5QUssUxuKiKa0fUIPhCDwcPpJpRA0pNp0d1FyWimJkLJPlQ
kM66EmYVYfwPj4785wuO/D+Ijvx/5Jr/Nn1z8cyhkToFx8lGwTEoelV+Fj9o
be6ukl7A/2UjtV0ZH3bjOQ2hqY1i58138z5xlbir+tb+oxi/BbtIICr6Iqqv
FSz3riJ9eX62HU6v01WcNO97XcX+tvNgCuNyYcQh647kc17LTzoE1zjuEXrS
GFArOtuIDLAe7SxrB/6cMgiTTqx+1GYW4v4oaO3E/LkeTFRuN+yHmoio6IqE
LkcW7Ls5mgBjqDHtTMu6LalRwyQIj/liNm9oeqtUVeme6880ydXtnjSkK4lX
ZrzX6XXtu8yOVGzCRrBeGoDn2kXkYclyrC9+kUzg58mmiHSZziQ/3GkqTmDZ
4fcQkOWjmjaDrpqoSbmodLtPb4PfUq4BrlOXMHQd0x84vFDnVlSIlKdYLiGL
elm67Yfq/K5NIxKgqTOHbrrbDP5ThoIrsapcWhUtXSFGxsG2EINzycPyey2K
8PVlcH/5VKpOvMOdY2L7GzzR9VZkPH9mRMdxc9EdLqL1fjZvMSkAg7ZnuY9Q
4L27Ead4LIBUuYte20iAWsESKDObECXFBbAgBU+O3u+ml8u5XsWaj2gZkxoA
yy43JK6v+8IEBdOgl0QKkGIQtO0pxxpC6horictwAcyau625KtCVaHt6g+mr
CY3nyNIlCS1FirqiWUm1A2dYCYXDluUNeZQeEDRMHZUPKa8uIhXkLCpzghzW
0g8OlDeIwVln99oVKXidoq7sdht6RxbDQvFH41QHV3ZHgR14ehrCiZkRCWuv
JRknboR3TjV4JgwTnNLuHKTIfEzLiDOj8lS355h2mi3RriYR7sa4jR2Rh/WA
Mw1eDlTnhNWg2m4jdhzgqTjLXRUsyHRbERfsZ86i3oAdjdLAlqHYZqtPlBQs
gYUfjbYLDOPGnbi8L8pTqgpzLl5UC76pjxUvcRUfA1oOlpDI2taSvvAlGw9O
UHiGQeh9W6DkkzsEImfGpJnAWN85EazEisC9XSIq3Zmt9iThIfISyIf13MNS
4SqAgaOcS5WHcjJ6BZq6f5bTdduJz4YSVtcFzuKauKCIltAKQMpYugXR7ejD
a1TJMZxXl04WVBSdFKGrhIrA5s4x/8Mdsl/uhplNP8x5j//ww/7hh/3DD/vt
+WHEtfTkYslnH0hu9MkpCqgSnNxLM15BuEFS27TZWhRsU7m+QVBRW6FrLg4m
O1KINudhXcck7d23SBrwCchZxTW+A5fJYFnXM1S48MuH+bkCUCRTzVPlsj2h
UbV39udTAe6KAlgQ7vNMsPbe5e3oKrl8kzw6fp4cPz4ZHO8l++zObH5xsneg
kr9RWZbcXLx0eiSLw4NbKllMg5nRBHFym0ku35MLCfzbLhTSNXGhtgNU6B/S
ZkLHcNEZefnQDDUNiR7wEP2L3MHcBvPJeUX4X7wH3uMjXeWbLR4+e/7n2ERN
rp9fj3yDqeOep6fJX6pWuojQGck1/IAVgm5QjH49Grq7v5I8vA9+r/lYMa81
kVhuyxy5Dd9Xfyq1ZywUONI8+odPw04mMBGNr3KUeukU2aWavTRWjlaak5uQ
OEaRJu1Cyj1SomdQCav4DzXZ0N/dV/A8nW69+TbuXKWtmNzxkWrwx7kSRzai
QWkblwCwySCLUfKu8vq4SYPZfo1k8mwmMsO1lZe3L3HcLKRwjOL/Rtwz7cfk
tX62gZPvdjLn5FJc4l3and0mdMxJ+LoMWD/met0ousL1B/uqmrUVXfpC974H
UOGg+97BMLlkEpIVx2S1TnrMeQxf929yxmmkAIoUh4qtk/01MRXnlzlwA49A
R6C7orZsbnWb5Es+YCCfJnhM/c1IZTV8WBZtWBRmOPglnB9iDNFvNChPPyOe
fju4eCuYBwfVdGqnIrnzR6KE1gfXFsIcwW3K4v7wFdC+ItfeIfuJghFb6WGJ
8UlPEl/h6owmqtGuyFdlL5z4n7ND+1KG+PLsDOkh9nhxYrCNaCMxnoXJGCnh
hIUaqR5kckhjElOPtYxDs72kdbXFkg90y5cpMpsgBjrK6Joy1SpUvuLUVKs1
lX4oVRhaYURzhfz8QoJ6MkyKygoe4I4Sf3jTIZd5YHaNayxzB2rJJpB00JbM
5EDXNDoAE1MjLWy7zSup9PJEuFyNiDvr1XQf6PPxqmdvzvhoKoBohQQfv8DV
T9r2gnIct8tgCZeGZ9VA93EPjk9NbQ3lvvm0edyTIloONPCBZ932NjW7rkFI
z4UdE9bG+86WnB3/kBxv/pxJkJ7QILf73Ni4nydu3pODWqP2uvh0FOcmSK/d
dN05/dP/bgu377gIELsoFnES1mofP3Y6kz5FfYUyE25CYS/ZH7rpq2KEi4pl
eP+mBAfBE7mFyUKls/gfnbBFPxS+c+yB98MPLKoKSVq3LFebVuI0wYwrP7fO
B9040CUQ8dCNHEqloc6klOkN8Wcj0caeqDr/o0B6QrALUkROIFbCjUlszrp4
vwwD+lA+arw5GPPNpbcQ2uS2Oaz3o529BYMQKRT2dt2LtWyzOFgILOaq8Fy5
YGjOMb4ugJDaBPE9nNPjK9x0xQoixQuFM0HCFrF12sw1FGzNbqfYMSmKumfG
nf4XB0o4PfsQEtPDTFJuk/r1ewMMFfYHFtKuy8mcACxOkn5wvzp94mhY/uaK
LG7G8fYGsEbbFO3cRMdKRFZ9stkbDWhjjRRPsbjqrsvJCVGTv5jx0ArsURVn
57k33p+cJJ3Lk7QWbLcLyFTlrrG0W+4NTqOf5TjkmolKfw9wboeE+Bz64B4H
UbtEqgkfiBRYIQ824feuRROc1qy1kd5ZIa0+0wPA+ExAx4IdREmvAcbnI7a8
FQmlzY5/N8Vj2FHJJ8lOvx7ZgJz4ulX2q+oZMYseKsI3S5OCnmprmUovyFFi
9/Yexy5/Q4yTZ7nt7bl6Nu2EnNAAucQ7uadyBeVZ/v1v/wsqt2zES+SoPMMQ
PRYqeTc6ixx/OS6NPTD8XFpygcjaPCfhIMdlgp9Dm0bX2JeEog3Br273gnoB
GhFjtYmAOt4v4VJxr0VSAH1mw+Q70Q67Dhb0b/6ny/MLmjeOHHhzgepXw64y
zFO7xvDC6uI1sOhp9RVPJ1qUs7T+hFvrAOuueF5Y2XCPt+brqpoR974zkoLi
DKL2kUTnRkT5BU1fxRY+zCac6U8oT47sCgfPEKcFoAVbmnYEip1f2W3kvORQ
IQ7TGqkx86eUydg+ZkdzfkfyMK5WcMzl9fGLmLvDiw5IqhYSRHFdbUbjjmRc
RXdJNzT/1VpGs7mNjheGX0YqA+TW3K+jBvdcA/NxiWsqy4lDuqj2SQt02M/m
fB5hLWcGS2kRp09zObEHvx8z+kZwhe5IfFKBHEui5TYKl2NT4LiTc87npK8X
hiYTEkB4BdnSYU8OxHzlojD+fBU+FZrcotPE/6yIPxR4xlwzLqoZfgXqED+x
c3j07FAW4KYw8MQfuAcH3CmPn8/74+JfjpkB3W9fXYS84M88BFu7yLwT6Q++
5XP/XQQRv6hVzhpGdw8dCvF7PryyqzrZidby6geTEw6UkArq8xEhuRm8MkWx
SEv6G3rJe4sox1uiz5EocS8/xcBujQT59fW8qZDdztv5+Q1HxR90h2M0G3KI
uSaB40fzNIvPi7STGq6Q/v4FZAgwKLfqn3Be7cNm8+S4ndlh8r5k7lnW5j7f
tvZB53pbZiUANplXuWR6pF+40jvcIYOMcDundLnvm8ofC2UrbXJIkktgMiko
5rxxQFF8Ylc/yi36TnjMl5FAqZjjy835yw9e+KxLfOSCxwHL6EeZYtOvXNuN
4Ow+NaVk7NOtetRzWOakUWhNg+RdNSbWTV61BcG/aW8PMu+KTVF1Ms/l1yLG
HPZlJePO0buSyglj9Cwemoh6sIL2p1wriiyEYaG6117z/ZkvyezzueIlN0j4
4424il2CkLj/QCEwZhDIs3/z7UHSJY7rfXGhyrBZNMDNt3IAxox1u/IiGYLa
54JFB9DDYz4tOKU3+ZMrePdCEoBUl6A26fDNF06fS0BIM2pSJsKnp3dMkcS6
IiaeoVl6XKMoM3Q4f2iSJ4PjI7JIac00l84IF2/0udKNIC03UIwrHGo2q40D
cKJSo8m5s6eIZbSa80fCaMPkhgsGOD1wpVGOJderpE3neYADify7o+ncT+Qc
DY9/x7bm+HfDHiEeGsZlx8O+H47T8o7DMP41mIM7v5eVSUojJHVu7xJ3EF+y
4BqIGuRCYYf5wGIjhTMMIeQIp1UlYcpuXNOlpvQ84I0F0VuPxQ9bkGBp4YBe
eaFXfNSH4yr8ipDcUFRzffs1SdXLtLjDTzORAfjxzvT2vnMn22zgG669AtS2
yqaLCivn4764NT9S/91TfgLy2feCA4dp18Gd9oCTPwG/C1V9pAD1w4AC6qFf
8aU7iUz7yeHe2nY6J8UF5kKbO3eCIJ9W7347ZirFF95MbJ8KJMfYa5odjfQL
knLkeAZAy7twrNPRTqIsSsKx8nCzUDnKqBVm2rgKGHWIfMbR5RpD1vO0xz9j
y9hMzorx50T3N76JEpXhdMi4vozvF7XUWmadittuuK6sNFjnm8qfeLTFHlqd
IlR3yUPOA+/cnKbi9+H7mA/06GXtuHBBwEOEzao6A/P6aZrCqlzjZIQ7qSeK
eND9xIKVXE4UVOzLEv1vD3DvSJGufclVVxufq7zw8aEL/BLaAA1R+FFGY2hC
wIYMUKBpmEXJn5TSudyeatW1y3pqAAvsxtOSX9SQU7DYC42qtPo7fuNQFI9t
CLrIYeL1XSIxGNgG+dmAHKd4w726eDUi2p2/uFFT+u4vo9uz16NB5NpxEwd5
Dyl+kNVBWJxGVK9RMGn5p/Eyd/8hOQ9cxmUy+c3IwdGzwcnxwWnv73/7N8Qy
tAJ/XvmfAgkhZ0mK+XfzmT21+9XEbkU6foMZZx2FicqhZ9VgIkWcyn7sEnI0
O7QV6bFqnfMs9gidOVy4F6d+mUmGf//bvzOBXsmonV/uHnVQynaj1zeEM3oe
+zcVCo0U+qfLnH/KF78EOiBPrbADhUryP57vAMDhcJlND5+RajHTJ+nkUZY+
OZ48Gp+YR0+zk2w8yY6fpY/H2aPs5OQoe84/HwiCn207obIgh0FYke46Ka0b
CEi7uDk6OHvj9mHyQmp7nZpRgVEuIpMKl99NiqfCu0zWr0j50A7nDZQdN82n
FJCSRhmSnJyx5HQVQDwXfrqFhPJCry62Sk67N/BvtblzqbRWsl3ocYdjQzwH
RXo87Ob28KbBOzc1xw/n/kDzfaSMNS5Ysqv6QzvOJYIq+XQOXxz4OHU44meN
KH9yQi/83O7YEJ0IxTebv2fgD6vuJY/ED/6Zm6mnAZCi58nyvMbrXUO7flW3
zfVuR+hKatZ8IV5M5Cl+d6CvKiDddtXDvu/Y8M/ts35D0B+WzkeqOIFVrqNf
6PkOLgLZ03sTQNrOqXYPU+fD4yaNUJZUUZ1FN4N3F1XDTVJ6mGBpVtLX5ZIS
2m3n6i00CNMXBCi5lA3crSdOuF8xIt39nQS9ymrlJI+f05+S9oVs4ummXQFM
XrlouaWB7XR92juWvdqGOA7beEYVCyRnf73iyEhcib2xP1x4y65BP7yUM/6p
Iu84HpY3ncF27Oqwd6ITDW9SasJ8bs3nYQWgnbK6Jb9idptLBSJAHHhyR3tC
9mimtP/4xealT72Pp0nZLsZ487/sTcmkmj2fIMQvqEROxTjCPO6ESZ6Z+s4c
2Z4xDJUhpXheM7kVn1gPRsf573dboeT+hgfd38D+vNcRsJHIgCtObKUkSWKr
eR1Fr6MfyNrl3A8R9B/2/i8zDeJjooMAAA==

-->

</rfc>
