<?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.29 (Ruby 2.7.0) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ietf-core-oscore-key-limits-05" category="info" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.29.0 -->
  <front>
    <title abbrev="Key Usage Limits for OSCORE">Key Usage Limits for OSCORE</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-core-oscore-key-limits-05"/>
    <author initials="R." surname="Höglund" fullname="Rikard Höglund">
      <organization>RISE AB</organization>
      <address>
        <postal>
          <street>Isafjordsgatan 22</street>
          <city>Kista</city>
          <code>16440 Stockholm</code>
          <country>Sweden</country>
        </postal>
        <email>rikard.hoglund@ri.se</email>
      </address>
    </author>
    <author initials="M." surname="Tiloca" fullname="Marco Tiloca">
      <organization>RISE AB</organization>
      <address>
        <postal>
          <street>Isafjordsgatan 22</street>
          <city>Kista</city>
          <code>16440 Stockholm</code>
          <country>Sweden</country>
        </postal>
        <email>marco.tiloca@ri.se</email>
      </address>
    </author>
    <date year="2025" month="July" day="07"/>
    <area>Internet</area>
    <workgroup>CoRE Working Group</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 56?>

<t>Object Security for Constrained RESTful Environments (OSCORE) uses AEAD algorithms to ensure confidentiality and integrity of exchanged messages. Due to known issues allowing forgery attacks against AEAD algorithms, limits should be followed on the number of times a specific key is used for encryption or decryption. Among other reasons, approaching key usage limits requires updating the OSCORE keying material before communications can securely continue. This document defines how two OSCORE peers can follow these key usage limits and what steps they should take to preserve the security of their communications.</t>
    </abstract>
    <note removeInRFC="true">
      <name>Discussion Venues</name>
      <t>Discussion of this document takes place on the
    Constrained RESTful Environments Working Group mailing list (core@ietf.org),
    which is archived at <eref target="https://mailarchive.ietf.org/arch/browse/core/"/>.</t>
      <t>Source for this draft and an issue tracker can be found at
    <eref target="https://github.com/core-wg/oscore-key-limits"/>.</t>
    </note>
  </front>
  <middle>
    <?line 60?>

<section anchor="intro">
      <name>Introduction</name>
      <t>Object Security for Constrained RESTful Environments (OSCORE) <xref target="RFC8613"/> provides end-to-end protection of CoAP <xref target="RFC7252"/> messages at the application-layer, ensuring message confidentiality and integrity, replay protection, as well as binding of response to request between a sender and a recipient.</t>
      <t>OSCORE uses AEAD algorithms to provide confidentiality and integrity of messages exchanged between two peers. Due to known issues allowing forgery attacks against AEAD algorithms, limits should be followed on the number of times a specific key is used to perform encryption or decryption <xref target="I-D.irtf-cfrg-aead-limits"/>.</t>
      <t>The OSCORE specification <xref target="RFC8613"/> does not consider such key usage limits. However, should they be exceeded, an adversary may break the security properties of the used AEAD algorithm, such as message confidentiality and integrity, e.g., by performing a message forgery attack. This and other reasons require that peers who are approaching the key usage limits update the OSCORE keying material before communications can securely continue. This document defines what steps an OSCORE peer should take to preserve the security of its communications, by stopping the use of an OSCORE Security Context shared with another peer when approaching the key usage limits.</t>
      <section anchor="terminology">
        <name>Terminology</name>
        <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" 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>
        <t>Readers are expected to be familiar with the terms and concepts related to CoAP <xref target="RFC7252"/> and OSCORE <xref target="RFC8613"/>.</t>
      </section>
    </section>
    <section anchor="aead-key-usage-limits-in-oscore">
      <name>AEAD Key Usage Limits in OSCORE</name>
      <t>This section details how key usage limits for AEAD algorithms can be considered when using OSCORE. In particular, it discusses specific limits for common AEAD algorithms used with OSCORE; parameters to track associated with an OSCORE Security Context; and additions to the OSCORE message processing.</t>
      <section anchor="problem-overview">
        <name>Problem Overview</name>
        <t>The OSCORE security protocol <xref target="RFC8613"/> uses AEAD algorithms to provide integrity and confidentiality of messages, as exchanged between two peers sharing an OSCORE Security Context.</t>
        <t>When processing messages with OSCORE, each peer should follow specific limits as to the number of times it uses a specific key. This applies separately to the Sender Key used to encrypt outgoing messages, and to the Recipient Key used to decrypt and verify incoming protected messages.</t>
        <t>Exceeding these limits may allow an adversary to break the security properties of the AEAD algorithm, such as message confidentiality and integrity, e.g., by performing a message forgery attack.</t>
        <t>The following refers to the two parameters 'q' and 'v' introduced in <xref target="I-D.irtf-cfrg-aead-limits"/>, to use when deploying an AEAD algorithm.</t>
        <ul spacing="normal">
          <li>
            <t>'q': this parameter has as value the number of messages protected with a specific key, i.e., the number of times the AEAD algorithm has been invoked to encrypt data with that key.</t>
          </li>
          <li>
            <t>'v': this parameter has as value the number of alleged forgery attempts that have been made against a specific key, i.e., the number of failed decryptions that have occurred with the AEAD algorithm for that key.</t>
          </li>
        </ul>
        <t>When a peer uses OSCORE:</t>
        <ul spacing="normal">
          <li>
            <t>The key used to protect outgoing messages is its Sender Key from its Sender Context.</t>
          </li>
          <li>
            <t>The key used to decrypt and verify incoming messages is its Recipient Key from its Recipient Context.</t>
          </li>
        </ul>
        <t>Both keys are derived as part of the establishment of the OSCORE Security Context, as defined in <xref section="3.2" sectionFormat="of" target="RFC8613"/>.</t>
        <t>As mentioned above, exceeding specific limits for the 'q' or 'v' value can weaken the security properties of the AEAD algorithm used, thus compromising secure communication requirements.</t>
        <t>Therefore, in order to preserve the security of the used AEAD algorithm, OSCORE has to observe limits for the 'q' and 'v' values, throughout the lifetime of the used AEAD keys.</t>
        <section anchor="limits">
          <name>Limits for 'q' and 'v'</name>
          <t>Formulas for calculating the security levels, as Integrity Advantage (IA) and Confidentiality Advantage (CA) probabilities, are presented in <xref target="I-D.irtf-cfrg-aead-limits"/>. These formulas take as input specific values for 'q' and 'v' (see section <xref target="problem-overview"/>) and for 'l', i.e., the maximum length of each message (in cipher blocks).</t>
          <t>For the algorithms shown in <xref target="algorithm-limits"/> that can be used as AEAD Algorithm for OSCORE, the main property to achieve is having IA and CA values which are no larger than p = 2^-64, which will ensure a safe security level for the AEAD Algorithm. This can be achieved by using the values q = 2^20, v = 2^20, and l = 2^10, that this document recommends using for these algorithms.</t>
          <t><xref target="algorithm-limits"/> also shows the resulting IA and CA probabilities enjoyed by the considered algorithms, when taking the value of 'q', 'v' and 'l' above as input to the formulas defined in <xref target="I-D.irtf-cfrg-aead-limits"/>.</t>
          <figure anchor="algorithm-limits">
            <name>Probabilities for algorithms based on chosen q, v and l values.</name>
            <artwork align="center"><![CDATA[
+------------------------+----------------+----------------+
| Algorithm name         | IA probability | CA probability |
|------------------------+----------------+----------------|
| AEAD_AES_128_CCM       | 2^-64          | 2^-66          |
| AEAD_AES_128_GCM       | 2^-97          | 2^-89          |
| AEAD_AES_256_GCM       | 2^-97          | 2^-89          |
| AEAD_CHACHA20_POLY1305 | 2^-73          | -              |
+------------------------+----------------+----------------+
]]></artwork>
          </figure>
          <t>When AEAD_AES_128_CCM_8 is used as AEAD Algorithm for OSCORE, the triplet (q, v, l) considered above yields larger values of IA and CA. Hence, specifically for AEAD_AES_128_CCM_8, this document recommends using the triplet (q, v, l) = (2^20, 2^14, 2^8). This is appropriate, since the resulting CA and IA values are not greater than the threshold value of 2^-50 defined in <xref target="I-D.irtf-cfrg-aead-limits"/>, and thus yields an acceptable security level. Achieving smaller values of CA and IA would require inconveniently reducing 'q', 'v' or 'l', with no corresponding increase in terms of security, as further elaborated in <xref target="aead-aes-128-ccm-8-details"/>.</t>
          <figure anchor="l-values-as-bytes">
            <name>Maximum length of each message (in bytes)</name>
            <artwork align="center"><![CDATA[
+------------------------+----------+----------+-----------+
| Algorithm name         | l=2^6 in | l=2^8 in | l=2^10 in |
|                        | bytes    | bytes    | bytes     |
|------------------------+----------+----------|-----------|
| AEAD_AES_128_CCM       | 1024     | 4096     | 16384     |
| AEAD_AES_128_GCM       | 1024     | 4096     | 16384     |
| AEAD_AES_256_GCM       | 1024     | 4096     | 16384     |
| AEAD_AES_128_CCM_8     | 1024     | 4096     | 16384     |
| AEAD_CHACHA20_POLY1305 | 4096     | 16384    | 65536     |
+------------------------+----------+----------+-----------+
]]></artwork>
          </figure>
          <t>With regards to the limit for 'l', the recommended 'l' value for the algorithms shown in <xref target="algorithm-limits"/>, and for AEAD_AES_128_CCM_8, is 2^10 (16384 bytes) and 2^8 (4096 bytes) respectively. Considering a typical MTU size of 1500 bytes, and the fact that the maximum block size when using block-wise transfers with CoAP is 1024 bytes (see <xref section="2" sectionFormat="of" target="RFC7959"/>), it is unlikely that a larger size of 'l' than what is recommended makes sense to use in typical network setups.</t>
          <t>However, although under typical circumstances an 'l' limit of 2^8 (4096 bytes) is acceptable, exceptional cases can warrant a higher value of 'l'. For instance, Block-wise Extension for Reliable Transport (BERT) extends the CoAP Block-Wise transfer functionality, enabling use of larger messages over reliable transports such as TCP or WebSockets (see <xref target="RFC8323"/>). In case the OSCORE peers wish to take full advantage of BERT functionality and the large message sizes it allows for, the OSCORE peers must use higher values of 'l'.</t>
          <t>An alternative means of allowing for larger values of 'l', while still maintaining the security properties of the used AEAD algorithm, is to adjust the 'q' and 'v' values to compensate. In practice, this means reducing the value of 'q' and 'v' considering the new value of 'l', to ensure an acceptably low value of the IA and CA probabilities. A reasonable target for the IA and CA probability values is the threshold value of 2^-50 defined in <xref target="I-D.irtf-cfrg-aead-limits"/>.</t>
        </section>
      </section>
      <section anchor="context">
        <name>Additional Information in the Security Context</name>
        <t>In addition to what is defined in <xref section="3.1" sectionFormat="of" target="RFC8613"/>, the following parameters associated with an OSCORE Security Context can be used for keeping track of the expiration of that OSCORE Security Context and maintaining key usage below safe limits.</t>
        <section anchor="common-context">
          <name>Common Context</name>
          <t>The Common Context has the following associated parameter.</t>
          <ul spacing="normal">
            <li>
              <t>'exp': with value the expiration time of the OSCORE Security Context, as a non-negative integer. The parameter contains a numeric value representing the number of seconds from 1970-01-01T00:00:00Z UTC until the specified UTC date/time, ignoring leap seconds, analogous to what is specified for NumericDate in <xref section="2" sectionFormat="of" target="RFC7519"/>.  </t>
              <t>
At the time indicated by this parameter, a peer must stop using this Security Context to process any incoming or outgoing messages, and is required to establish a new Security Context to continue OSCORE-protected communications with the other peer. That is, the expiration of an OSCORE Security Context means that the current Sender Key must no longer be used for protecting outgoing messages, and the Recipient Key must no longer be used for unprotecting incoming messages.  </t>
              <t>
The value of 'exp' must be set upon installing the OSCORE Security Context, namely at time t_1, considering a lifetime value t_l. In particular, t_l can be a default value (potentially differing between the two peers sharing the OSCORE Security Context), or can be agreed by the two peers during the establishment of the OSCORE Security Context. For instance, this value may be stored and/or transported in an OSCORE LwM2M object, or specified as part of an EDHOC Application Profile <xref section="3.9" sectionFormat="of" target="RFC9528"/> used when executing EDHOC to establish the OSCORE Security Context. Regardless of how the lifetime value is determined, the 'exp' parameter is set to indicate the point in time corresponding to t_1 offset by t_l.</t>
            </li>
          </ul>
        </section>
        <section anchor="sender-context">
          <name>Sender Context</name>
          <t>The Sender Context has the following associated parameters.</t>
          <ul spacing="normal">
            <li>
              <t>'count_q': a non-negative integer counter, keeping track of the current 'q' value for the Sender Key. At any time, 'count_q' has as value the number of messages that have been encrypted using the Sender Key. The value of 'count_q' is set to 0 when establishing the Sender Context.</t>
            </li>
            <li>
              <t>'limit_q': a non-negative integer, which specifies the highest value that 'count_q' is allowed to reach, before stopping using the Sender Key to process outgoing messages.  </t>
              <t>
The value of 'limit_q' depends on the AEAD algorithm specified in the Common Context, considering the properties of that algorithm. The value of 'limit_q' is determined according to <xref target="limits"/>.</t>
            </li>
          </ul>
          <t>Note for implementors: it is possible to avoid storing and maintaining the counter 'count_q'. Rather, an estimated value to be compared against 'limit_q' can be computed, by leveraging the Sender Sequence Number (SSN) of the peer and (an estimate of) the other peer's SSN. A possible method to achieve this is described in <xref target="estimation-count-q"/>. While this relieves peers from storing and maintaining the precise 'count_q' value, it results in overestimating the number of encryptions performed with a Sender Key. This in turn results in approaching 'limit_q' sooner and thus in performing a key update procedure more frequently.</t>
        </section>
        <section anchor="recipient-context">
          <name>Recipient Context</name>
          <t>The Recipient Context has the following associated parameters.</t>
          <ul spacing="normal">
            <li>
              <t>'count_v': a non-negative integer counter, keeping track of the current 'v' value for the Recipient Key. At any time, 'count_v' has as value the number of failed decryptions occurred for incoming messages using the Recipient Key. The value of 'count_v' is set to 0 when establishing the Recipient Context.</t>
            </li>
            <li>
              <t>'limit_v': a non-negative integer, which specifies the highest value that 'count_v' is allowed to reach, before stopping using the Recipient Key to process incoming messages.  </t>
              <t>
The value of 'limit_v' depends on the AEAD algorithm specified in the Common Context, considering the properties of that algorithm. The value of 'limit_v' is determined according to <xref target="limits"/>.</t>
            </li>
          </ul>
        </section>
      </section>
      <section anchor="oscore-message-processing">
        <name>OSCORE Message Processing</name>
        <t>To keep track of the 'q' and 'v' values and ensure that AEAD keys are not used beyond reaching their limits, OSCORE peers protect messages with OSCORE as defined in this section.</t>
        <t>A limitation that is introduced is that, in order to not exceed the selected value for 'l', the total size of the COSE plaintext <xref target="RFC9052"/>, authentication Tag, and possible cipher padding for a message must not exceed the block size for the selected algorithm multiplied with 'l‘. The size of the COSE plaintext is calculated as described in <xref section="5.3" sectionFormat="of" target="RFC8613"/>.</t>
        <t>If OSCORE peers need to transmit messages exceeding the maximum recommended size calculated from 'l', CoAP Block-Wise transfers <xref target="RFC7959"/> may be used to split content into smaller segments. The following steps can be adopted by a client or server to determine whether the usage of block-wise transfer is necessary for the transmission of a specific OSCORE protected message.</t>
        <ol spacing="normal" type="1"><li>
            <t>The CoAP message to transmit is first produced.</t>
          </li>
          <li>
            <t>The sum of the total size of the COSE plaintext, the length of the authentication tag, and the length of any potential ciphertext padding should be computed to produce a value T. It should be noted that the size of the padding and the length of the authentication tag depend on the used AEAD algorithm.</t>
          </li>
          <li>
            <t>If the value of T exceeds the 'l' value for the used AEAD algorithm, block-wise transfer is to be used with the CoAP message before protecting it with OSCORE.</t>
          </li>
        </ol>
        <t>The processing of CoAP messages with OSCORE follows the steps outlined in <xref section="8" sectionFormat="of" target="RFC8613"/>, with the additions defined below.</t>
        <section anchor="protecting-req-resp">
          <name>Protecting a Request or a Response</name>
          <t>Before encrypting the COSE object using the Sender Key, the 'count_q' counter is incremented.</t>
          <t>If 'count_q' exceeds the 'limit_q' limit, the message processing is aborted. From then on, the Sender Key must not be used to encrypt further messages.</t>
        </section>
        <section anchor="verifying-req-resp">
          <name>Verifying a Request or a Response</name>
          <t>If an incoming message is detected to be a replay (see <xref section="7.4" sectionFormat="of" target="RFC8613"/>), the 'count_v' counter is not incremented.</t>
          <t>If the decryption and verification of the COSE object using the Recipient Key fails, the 'count_v' counter is incremented.</t>
          <t>After 'count_v' has exceeded the 'limit_v' limit, incoming messages must not be decrypted and verified using the Recipient Key, and their processing must be aborted.</t>
        </section>
      </section>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>This document mainly covers security considerations about using AEAD keys in OSCORE and their usage limits, in addition to the security considerations of <xref target="RFC8613"/>.</t>
      <t>[TODO: Add more considerations.]</t>
    </section>
    <section anchor="iana">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-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="RFC7252">
          <front>
            <title>The Constrained Application Protocol (CoAP)</title>
            <author fullname="Z. Shelby" initials="Z." surname="Shelby"/>
            <author fullname="K. Hartke" initials="K." surname="Hartke"/>
            <author fullname="C. Bormann" initials="C." surname="Bormann"/>
            <date month="June" year="2014"/>
            <abstract>
              <t>The Constrained Application Protocol (CoAP) is a specialized web transfer protocol for use with constrained nodes and constrained (e.g., low-power, lossy) networks. The nodes often have 8-bit microcontrollers with small amounts of ROM and RAM, while constrained networks such as IPv6 over Low-Power Wireless Personal Area Networks (6LoWPANs) often have high packet error rates and a typical throughput of 10s of kbit/s. The protocol is designed for machine- to-machine (M2M) applications such as smart energy and building automation.</t>
              <t>CoAP provides a request/response interaction model between application endpoints, supports built-in discovery of services and resources, and includes key concepts of the Web such as URIs and Internet media types. CoAP is designed to easily interface with HTTP for integration with the Web while meeting specialized requirements such as multicast support, very low overhead, and simplicity for constrained environments.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7252"/>
          <seriesInfo name="DOI" value="10.17487/RFC7252"/>
        </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>
        <reference anchor="RFC8613">
          <front>
            <title>Object Security for Constrained RESTful Environments (OSCORE)</title>
            <author fullname="G. Selander" initials="G." surname="Selander"/>
            <author fullname="J. Mattsson" initials="J." surname="Mattsson"/>
            <author fullname="F. Palombini" initials="F." surname="Palombini"/>
            <author fullname="L. Seitz" initials="L." surname="Seitz"/>
            <date month="July" year="2019"/>
            <abstract>
              <t>This document defines Object Security for Constrained RESTful Environments (OSCORE), a method for application-layer protection of the Constrained Application Protocol (CoAP), using CBOR Object Signing and Encryption (COSE). OSCORE provides end-to-end protection between endpoints communicating using CoAP or CoAP-mappable HTTP. OSCORE is designed for constrained nodes and networks supporting a range of proxy operations, including translation between different transport protocols.</t>
              <t>Although an optional functionality of CoAP, OSCORE alters CoAP options processing and IANA registration. Therefore, this document updates RFC 7252.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8613"/>
          <seriesInfo name="DOI" value="10.17487/RFC8613"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="I-D.irtf-cfrg-aead-limits">
          <front>
            <title>Usage Limits on AEAD Algorithms</title>
            <author fullname="Felix Günther" initials="F." surname="Günther">
              <organization>IBM Research Europe - Zurich</organization>
            </author>
            <author fullname="Martin Thomson" initials="M." surname="Thomson">
              <organization>Mozilla</organization>
            </author>
            <author fullname="Christopher A. Wood" initials="C. A." surname="Wood">
              <organization>Cloudflare</organization>
            </author>
            <date day="8" month="April" year="2025"/>
            <abstract>
              <t>   An Authenticated Encryption with Associated Data (AEAD) algorithm
   provides confidentiality and integrity.  Excessive use of the same
   key can give an attacker advantages in breaking these properties.
   This document provides simple guidance for users of common AEAD
   functions about how to limit the use of keys in order to bound the
   advantage given to an attacker.  It considers limits in both single-
   and multi-key settings.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-irtf-cfrg-aead-limits-10"/>
        </reference>
        <reference anchor="RFC7519">
          <front>
            <title>JSON Web Token (JWT)</title>
            <author fullname="M. Jones" initials="M." surname="Jones"/>
            <author fullname="J. Bradley" initials="J." surname="Bradley"/>
            <author fullname="N. Sakimura" initials="N." surname="Sakimura"/>
            <date month="May" year="2015"/>
            <abstract>
              <t>JSON Web Token (JWT) is a compact, URL-safe means of representing claims to be transferred between two parties. The claims in a JWT are encoded as a JSON object that is used as the payload of a JSON Web Signature (JWS) structure or as the plaintext of a JSON Web Encryption (JWE) structure, enabling the claims to be digitally signed or integrity protected with a Message Authentication Code (MAC) and/or encrypted.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7519"/>
          <seriesInfo name="DOI" value="10.17487/RFC7519"/>
        </reference>
        <reference anchor="RFC7959">
          <front>
            <title>Block-Wise Transfers in the Constrained Application Protocol (CoAP)</title>
            <author fullname="C. Bormann" initials="C." surname="Bormann"/>
            <author fullname="Z. Shelby" initials="Z." role="editor" surname="Shelby"/>
            <date month="August" year="2016"/>
            <abstract>
              <t>The Constrained Application Protocol (CoAP) is a RESTful transfer protocol for constrained nodes and networks. Basic CoAP messages work well for small payloads from sensors and actuators; however, applications will need to transfer larger payloads occasionally -- for instance, for firmware updates. In contrast to HTTP, where TCP does the grunt work of segmenting and resequencing, CoAP is based on datagram transports such as UDP or Datagram Transport Layer Security (DTLS). These transports only offer fragmentation, which is even more problematic in constrained nodes and networks, limiting the maximum size of resource representations that can practically be transferred.</t>
              <t>Instead of relying on IP fragmentation, this specification extends basic CoAP with a pair of "Block" options for transferring multiple blocks of information from a resource representation in multiple request-response pairs. In many important cases, the Block options enable a server to be truly stateless: the server can handle each block transfer separately, with no need for a connection setup or other server-side memory of previous block transfers. Essentially, the Block options provide a minimal way to transfer larger representations in a block-wise fashion.</t>
              <t>A CoAP implementation that does not support these options generally is limited in the size of the representations that can be exchanged, so there is an expectation that the Block options will be widely used in CoAP implementations. Therefore, this specification updates RFC 7252.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7959"/>
          <seriesInfo name="DOI" value="10.17487/RFC7959"/>
        </reference>
        <reference anchor="RFC8323">
          <front>
            <title>CoAP (Constrained Application Protocol) over TCP, TLS, and WebSockets</title>
            <author fullname="C. Bormann" initials="C." surname="Bormann"/>
            <author fullname="S. Lemay" initials="S." surname="Lemay"/>
            <author fullname="H. Tschofenig" initials="H." surname="Tschofenig"/>
            <author fullname="K. Hartke" initials="K." surname="Hartke"/>
            <author fullname="B. Silverajan" initials="B." surname="Silverajan"/>
            <author fullname="B. Raymor" initials="B." role="editor" surname="Raymor"/>
            <date month="February" year="2018"/>
            <abstract>
              <t>The Constrained Application Protocol (CoAP), although inspired by HTTP, was designed to use UDP instead of TCP. The message layer of CoAP over UDP includes support for reliable delivery, simple congestion control, and flow control.</t>
              <t>Some environments benefit from the availability of CoAP carried over reliable transports such as TCP or Transport Layer Security (TLS). This document outlines the changes required to use CoAP over TCP, TLS, and WebSockets transports. It also formally updates RFC 7641 for use with these transports and RFC 7959 to enable the use of larger messages over a reliable transport.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8323"/>
          <seriesInfo name="DOI" value="10.17487/RFC8323"/>
        </reference>
        <reference anchor="RFC9052">
          <front>
            <title>CBOR Object Signing and Encryption (COSE): Structures and Process</title>
            <author fullname="J. Schaad" initials="J." surname="Schaad"/>
            <date month="August" year="2022"/>
            <abstract>
              <t>Concise Binary Object Representation (CBOR) is a data format designed for small code size and small message size. There is a need to be able to define basic security services for this data format. This document defines the CBOR Object Signing and Encryption (COSE) protocol. This specification describes how to create and process signatures, message authentication codes, and encryption using CBOR for serialization. This specification additionally describes how to represent cryptographic keys using CBOR.</t>
              <t>This document, along with RFC 9053, obsoletes RFC 8152.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="96"/>
          <seriesInfo name="RFC" value="9052"/>
          <seriesInfo name="DOI" value="10.17487/RFC9052"/>
        </reference>
        <reference anchor="RFC9528">
          <front>
            <title>Ephemeral Diffie-Hellman Over COSE (EDHOC)</title>
            <author fullname="G. Selander" initials="G." surname="Selander"/>
            <author fullname="J. Preuß Mattsson" initials="J." surname="Preuß Mattsson"/>
            <author fullname="F. Palombini" initials="F." surname="Palombini"/>
            <date month="March" year="2024"/>
            <abstract>
              <t>This document specifies Ephemeral Diffie-Hellman Over COSE (EDHOC), a very compact and lightweight authenticated Diffie-Hellman key exchange with ephemeral keys. EDHOC provides mutual authentication, forward secrecy, and identity protection. EDHOC is intended for usage in constrained scenarios, and a main use case is to establish an Object Security for Constrained RESTful Environments (OSCORE) security context. By reusing CBOR Object Signing and Encryption (COSE) for cryptography, Concise Binary Object Representation (CBOR) for encoding, and Constrained Application Protocol (CoAP) for transport, the additional code size can be kept very low.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9528"/>
          <seriesInfo name="DOI" value="10.17487/RFC9528"/>
        </reference>
      </references>
    </references>
    <?line 224?>

<section anchor="aead-aes-128-ccm-8-details">
      <name>Detailed considerations for AEAD_AES_128_CCM_8</name>
      <t>For the AEAD_AES_128_CCM_8 algorithm when used as AEAD Algorithm for OSCORE, larger IA and CA values are achieved, depending on the value of 'q', 'v' and 'l'. <xref target="algorithm-limits-ccm8"/> shows the resulting IA and CA probabilities enjoyed by AEAD_AES_128_CCM_8, when taking different values of 'q', 'v' and 'l' as input to the formulas defined in <xref target="I-D.irtf-cfrg-aead-limits"/>.</t>
      <t>As shown in <xref target="algorithm-limits-ccm8"/>, it is especially possible to achieve the lowest IA = 2^-50 and a good CA = 2^-70 by considering the largest possible value of the (q, v, l) triplet equal to (2^20, 2^10, 2^8), while still keeping a good security level. Note that the value of 'l' does not impact the IA, while CA displays good values for every considered value of 'l'.</t>
      <figure anchor="algorithm-limits-ccm8">
        <name>Probabilities for AEAD_AES_128_CCM_8 based on chosen q, v and l values.</name>
        <artwork align="center"><![CDATA[
+-----------------------+----------------+----------------+
| 'q', 'v' and 'l'      | IA probability | CA probability |
|-----------------------+----------------+----------------|
| q=2^20, v=2^20, l=2^8 | 2^-44          | 2^-70          |
| q=2^15, v=2^20, l=2^8 | 2^-44          | 2^-80          |
| q=2^10, v=2^20, l=2^8 | 2^-44          | 2^-90          |
| q=2^20, v=2^15, l=2^8 | 2^-49          | 2^-70          |
| q=2^15, v=2^15, l=2^8 | 2^-49          | 2^-80          |
| q=2^10, v=2^15, l=2^8 | 2^-49          | 2^-90          |
| q=2^20, v=2^14, l=2^8 | 2^-50          | 2^-70          |
| q=2^15, v=2^14, l=2^8 | 2^-50          | 2^-80          |
| q=2^10, v=2^14, l=2^8 | 2^-50          | 2^-90          |
| q=2^20, v=2^10, l=2^8 | 2^-54          | 2^-70          |
| q=2^15, v=2^10, l=2^8 | 2^-54          | 2^-80          |
| q=2^10, v=2^10, l=2^8 | 2^-54          | 2^-90          |
|-----------------------+----------------+----------------|
| q=2^20, v=2^20, l=2^6 | 2^-44          | 2^-74          |
| q=2^15, v=2^20, l=2^6 | 2^-44          | 2^-84          |
| q=2^10, v=2^20, l=2^6 | 2^-44          | 2^-94          |
| q=2^20, v=2^15, l=2^6 | 2^-49          | 2^-74          |
| q=2^15, v=2^15, l=2^6 | 2^-49          | 2^-84          |
| q=2^10, v=2^15, l=2^6 | 2^-49          | 2^-94          |
| q=2^20, v=2^14, l=2^6 | 2^-50          | 2^-74          |
| q=2^15, v=2^14, l=2^6 | 2^-50          | 2^-84          |
| q=2^10, v=2^14, l=2^6 | 2^-50          | 2^-94          |
| q=2^20, v=2^10, l=2^6 | 2^-54          | 2^-74          |
| q=2^15, v=2^10, l=2^6 | 2^-54          | 2^-84          |
| q=2^10, v=2^10, l=2^6 | 2^-54          | 2^-94          |
+-----------------------+----------------+----------------+
]]></artwork>
      </figure>
    </section>
    <section anchor="estimation-count-q">
      <name>Estimation of 'count_q'</name>
      <t>This section defines a method to compute an estimate of the counter 'count_q' (see <xref target="sender-context"/>), hence not requiring a peer to store it in its own Sender Context.</t>
      <t>This method relies on the fact that, at any point in time, a peer has performed <em>at most</em> ENC = (SSN + SSN*) encryptions using its own Sender Key, where:</t>
      <ul spacing="normal">
        <li>
          <t>SSN is the current value of this peer's Sender Sequence Number.</t>
        </li>
        <li>
          <t>SSN* is the current value of other peer's Sender Sequence Number. That is, SSN* is an overestimation of the responses without Partial IV that this peer has sent.</t>
        </li>
      </ul>
      <t>Thus, when protecting an outgoing message (see <xref target="protecting-req-resp"/>), the peer aborts the message processing if the estimated est_q &gt; limit_q, where est_q = (SSN + X) and X is determined as follows.</t>
      <ul spacing="normal">
        <li>
          <t>If the outgoing message is a response, X is the Partial IV specified in the corresponding request that this peer is responding to. Note that X &lt; SSN* always holds.</t>
        </li>
        <li>
          <t>If the outgoing message is a request, X is the highest Partial IV value marked as received in this peer's Replay Window plus 1, or 0 if it has not accepted any protected message from the other peer yet. That is, X is the highest Partial IV specified in a message received from the other peer, i.e., the highest seen Sender Sequence Number of the other peer. Note that, also in this case, X &lt; SSN* always holds.</t>
        </li>
      </ul>
    </section>
    <section anchor="sec-document-updates" removeInRFC="true">
      <name>Document Updates</name>
      <section anchor="sec-04-05">
        <name>Version -04 to -05</name>
        <ul spacing="normal">
          <li>
            <t>Editorial updates.</t>
          </li>
        </ul>
      </section>
      <section anchor="sec-03-04">
        <name>Version -03 to -04</name>
        <ul spacing="normal">
          <li>
            <t>Various editorial updates.</t>
          </li>
          <li>
            <t>Improved references.</t>
          </li>
        </ul>
      </section>
      <section anchor="sec-02-03">
        <name>Version -02 to -03</name>
        <ul spacing="normal">
          <li>
            <t>Editorial improvements.</t>
          </li>
        </ul>
      </section>
      <section anchor="sec-01-02">
        <name>Version -01 to -02</name>
        <ul spacing="normal">
          <li>
            <t>Updated references.</t>
          </li>
        </ul>
      </section>
      <section anchor="sec-00-01">
        <name>Version -00 to -01</name>
        <ul spacing="normal">
          <li>
            <t>Extended discussion on setting the lifetime of OSCORE Security Contexts.</t>
          </li>
          <li>
            <t>Mention adjusting the 'q' and 'v' values to compensate for a larger 'l' value.</t>
          </li>
          <li>
            <t>Specify how to perform pre-calculation of message size to determine need for block-wise.</t>
          </li>
          <li>
            <t>Cover exceptional cases where the 'l' value needs to be larger than 2^8.</t>
          </li>
          <li>
            <t>Note on relevance of 'l' limit considering maximum block size and typical MTU.</t>
          </li>
        </ul>
      </section>
      <section anchor="sec-00">
        <name>Version -00</name>
        <ul spacing="normal">
          <li>
            <t>Editorial improvements.</t>
          </li>
          <li>
            <t>Extended terminology.</t>
          </li>
          <li>
            <t>Recommendation on limits for CCM_8. Details in Appendix.</t>
          </li>
          <li>
            <t>Example of method to estimate and not store 'count_q'.</t>
          </li>
          <li>
            <t>Split out material from Key Update for OSCORE draft into this new document.</t>
          </li>
        </ul>
      </section>
    </section>
    <section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>The authors sincerely thank <contact fullname="Christian Amsüss"/>, <contact fullname="Carsten Bormann"/>, <contact fullname="John Preuß Mattsson"/>, <contact fullname="Göran Selander"/> and <contact fullname="Rafa Marin-Lopez"/> for their feedback and comments.</t>
      <t>The work on this document has been partly supported by VINNOVA and the Celtic-Next projects CRITISEC and CYPRESS; and by the H2020 project SIFIS-Home (Grant agreement 952652).</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA81cW3MbOXZ+569ASQ+WZkkuRV0saeNUaFkea9eSHFG2Z7Le
dTWbINmjZoPuC2WurVR+Rt7yL/Ypb/NP8ktyLgAa6OZFnpmk1jU1ppsN4ODg
nO9cwVar1Zifiv1GI4/yWJ6KP8mFeJsFYyleR9Moz8RIpeK6f3Z9c94IBoNU
zte/M1RhEkxhomEajPJWJPNRK1SpbKmM/rqTi1ZMo1pxkMssbzS2RZYHyfBj
EKsEBuZpIRuNaJbSxyzvdjonnW4jSGVwKi6SXKaJzBv341Nxpm7OxXuV3kXJ
WHyfqmLWuLsv32m9QBIaYZCfiigZqUZWDKZRlkUqyRczWOni/PZloxGqIYw/
FQVQetxoBEU+UelpQ9Cflv5bwAzZqbhpi1c//30cF8nQfsHbvYnugnRY/1al
MPXNRf9c9J7bh1meSglUXWTB6CeVDrNxABwQ3a59I4zyBTA6As6Uz9QQFuqf
t/aODg46op+r8G6i4qnzQpHkKYzr38uhTOxzOQ2i+FSkRGJ7oojCf0mjdiaX
b/OyLW6jWIVBZZOXQRqq6lf/QDucIn3tnOjT+2skKp0GeTSXeKQ3L8+6e3sn
+uPT7mFXfzzee3pgPh7t7Z+CAILEOCMvWi/aUYrCPErHrUAGQy3GZq7DctqT
Q/PxeL+7rz+edOxiJ4fdY1hBJjnyAJ71z1+/PBVbf4bvWj/An79sNRqtVksE
A+BjEIKOXA9+kmEu+jIsUhhEGnemEvw6SuRQ3Jz3b0dFLM6TeZSqZApzZ2KH
dXJXFJnMRO+890IE8VjBBJNpJnIlZJIVqQSuJqNoiOQEMU4OyghykMsxLaVG
Qn4OJ0EyhnWmMkPFz9riRSFxirtE3ScCtKqAJYI4VveojEDeWKYwU54H4R18
MQYys7xKQ1MwD0U2UUU8FAMJI3EOWEklIp9IkRTTgUyRiDya4hIim8kwGkWh
ACiBhXFzQ+KHTMJ0MctBvUEmxVCaf7VFb6qAKAXzpQJgJAPGNUUwm6UqCCdI
L05VEKJpglL5qYhSWK+YDUEG4BUkhvmJb+MTEA6ZAsuAbFge2TidFkkEeAOL
ZiIEec/wvGS8QBbDLIUExZoAzYCSBZ4RUDmC88vERN2L/F6ZFWZSpjwD8wNX
z2SdTDyp+0mQg77JWYZvLQwv8+CODmgGu5DpXNIGMiM/yM+JjNIK0W2Wu2k0
HMYSkRmwNFXDIiSubosv2xE+ePi1Avnli1a0hwcgUM1B+jI4v2ErVy34C5/l
khcFSs9U7w0PQY2FIUYKQb5oW3CUsd4CWJWFTJss2nRK/O56IW/Cgc9gpLMw
CEgm7mUc49+DKEEjgcQAO2ewT+ItSgmYMBCA/F7KBIUTqAchw8kD+DqMZhEs
CWzVB7tKEzUTNqui3Xqpk2Z1lB8SnH805cT9yRThdKWOwvGuRNiHB+Dfbal+
Zo1ADyxFaaiAiETlyMYswoPIinBSUxsw4rCLOYqJURZUHNggMFWCYRnC4cNp
DuGVLABOTUEywPUJ7nwlgkODfeURLMr6xNv1+dhkGkCIHimJsj1uN8VgYXiG
RxbYwf7haTjBGTx0M/gFRIGKMJrcT5QAJ8rDPaS5BioEefL/GPAc1IJhDuw9
Gr+QVJ8C4lqWq9nM7A3OA18tV7B4BViVy89AwgR4AiAKRwWvMROJjPsJKvQG
XoFgbm+LW4mnpGI1XohtBMm8fPDAoosD79EPEluXb/u3W03+W1xd0+eb8399
e3Fz/gI/91/1Xr+2H8wb/VfXb1+/KD+VI8+uLy/Pr17wYHgqKo8uez9uNUlE
tq7f3F5cX/Veb4G8wX7cc0HJAG6DDqAopsD1HNgCUgvIHKbRQKKMiudnb8Te
AescOlKgc6x/4D7BZ+QZL6USkAH+J+kWMFIGKU4BMASSMovyIM4IY+G8AaSA
7xK4eQNqj8KK5MjPoOg54weCTzCN4ggmobPC00A2s/CDtIVyRnYbowoaUrMa
+KIWAwc08AhZZWthTWTEBs8QmJVpkzSUObibbLRr2oOGsArwqBkDaVEJ5Q2l
q8hQrniJNphaMQsATcIiDgCZItCVKAuLDC2GhVVnEZR9IKa6FkEQsYgn/gPO
Ct57jmwFtqBDeQd8z1QYEau06K/SkD+wMRsOI9ZynKJEBgNLoCYhfIT9sEq8
SdUgllNxDRA6j+Q9KMWMH7WUfvTgg7oDquD2q9gD9k1mszSRWho8gHXMJknc
GtNJeECIu5IhsMH3eHrllkuj7PAdgByAw4M07ctVDzOwTK3aU5AB2rlvVw3o
o9ODsiHxgHMEXT1Nn52QP5FosjJouytUkY+VSzKrqx54YxwWb6y20vQinF00
AsuegPThNNpfciODRuOcrKjGzMxqBlpRckJ844ra/Rjb+v9pVlk0+bzwxVSO
jPog7qC0lEr15NMTWuzJ/ImItL/McLnWqWnidGigCAuG4H+qhZY8f6tAzXe4
yClDtl1ZTAISnnkQF7IiP1YiywNiPfckCVCmLdvNpbJXZzmtN0B1iZK5uvMF
C1yGwCAzWHYUUyJ7/k1kg3jIMYdz5jjkFHGdJp0E4AYQAVOwEtZvfcyeRgDY
MG/pcLpTqhCEznoBSzaOcOtsi9Q/YNUm/WSNP8UN31ovQTu+zP+64qF3jFrh
KOsoVVP3WQk49XnXKWV1CV+t7Srl43Kh5+AB4TpsgYGIaM5uAJomo4kQ8gSD
OMom5DnohyvQssk+xIiCQlKJvrai++0ujnUNcQ+1OcFvcdEBWIqmdslxW8uM
IK6M+gcfUf1YptDc3gOiyOTbMIWYi5JTkGcJr08jwnf2an1v07jYFNkyYKTk
Fjdxm+DqwQFuCL+XhwuakRM2C2rAw5fs2WAObTpDulNVjMHUcFAcRyOJqlxf
DM+XzPS2m8B1p/yyrVGq0XgJWAkeifY5ghjdE5sQsRuKIZzS/tyFtcW94TxI
coTXnYveLk1+VgFp55UzeAV9hGAAbh4eUpNkkBiY5I8AVLSLaG5GhmIKIQL0
42bAEys+zK/anncyKa2L9+VLzV154B3QsPiJCzPT4HM0LabAhGQM6oMJMzT9
xrbsAOGgaRhZDGIFEfdum9jKqYvSn2FHmHZpn9rNMf5oR5KOMtAeUc+DKeN8
MF1RYoSe7CxGMnBQiAsAfHiIFz0+lp7hyv0kQrMKjE+UAEd0LAn6YB7xTHT/
2jo6aOp37iPw5HUGESA4GFXFwQqrT6Z2X/RWNElDtMzsD+MITcwnWrPbaYq5
/YTkxvSvvU6TueJHMqlEPQUEzfSEmozMZTacwFIuQ1Ci6CDYAILsFXHuM8qT
UWDAT2rB5OMAx8V3Mylk4kEcvf2hoIAANkn6SArjJ4x6pdBqj8OKtIek6zMm
/17+afyuteJP7Yv6g8ZXR8SwDmCS7uIrcqVkxwIenFUeNL7+8pW/4sogOh97
5/2Pe93jj2dnl3ZlEkXhkIIPjpwH1cHf+4NPnlYGH5+sGNw9PPplg89e9eC/
bufjm+vXP+7tdw753af77uCW8P58/XVH5Z75l1OxXZVwQVW+Z1tvPBlGBXFw
aBBknOILJwqgV3xC9WO1Y71sbwFAgBOc3rUAxcfJs60QETrdetC+EW7/AzLv
A7L+Ax7ch4/HNh+4GbnyNJrFMhc7uHZTxLueYpGKLCIZg4priNKAARplFbUt
XoFzCubY5gvjeGHD8zp5zU04spywZ2KHgQkA6QD/f7yrEY5jNIDfFANtoAMc
NFmBlTOm9sLiLyNvLsYQEuUGe2nlCYyaKAgjLXiAMB12Hg0JOtJD50bzDsOw
EPMm4M1VwbsteoTM5P5M0S93mVySfU+RrUk3oguazGWCXiUwG06rCHEGC3PG
eJKnDRYmVCkn1MnDg+GYwJSUnqLkDqxl6CLnYlSklKKTMUhBGli3gHYayKwF
B9oKw2nruKWzNL8IC5d/XI+F8bPuX4+QGv54XH7c69BnGLziz1cwHzlwduXH
RwKp89F9fS2Q7nW6B/rjQefkyDw92j8+2Ayk3zS4CqTfvDKQDSjyjYOXofCy
EV/F0eHh/tE3oPBKIamicNxizWkFWYuPVMPw5WbHkd7fXQe4qEmpHAeYXNbu
Aql86aky5Gg0k+xnMIiMvtELbVoXeBWGAuiRwO8wY5l8GoUqsUOc1w9R8dHd
BrRZtKl4iADPeZl8MUPAFpe3bwE3/0Zwt3fY6fBYA2WYFA5z4wSWjji52TzO
SbTS09Z9hLW7NEgySukQEFGqGCgnoeITomigDFZNqIq1fYgEKD2L5iyJozvK
vCEJgbFGhmJkNAE4VTuizDuFKUQnmL3TtcRCw57eeCLpvOH7vJihu2pLVkGc
TzDOg8UpxtQDwigFw4WdNKEkaMfFWRDIVFSYj8bJYj9H2ZQXwZkCzGlQEB2k
wCjc2CQaT4wF0DtrC4xhMAMTkJl9XrL3/HMO20K+oajcyDgiC3OLXJ+pFMzn
8/Ob211YNSf7imdHZ8BzvHePCCA/CZkyzuMlmHuA49S1Hc1ym/PAeA3LALxk
bpbMbL7w9uwNmqH3ctCHxWRuz1r3a8DxUjIe2eBmNnQVLcompGYYW44KLA/b
EBaowX35FFtRJUKtbqOIUIKXMqLkgzXrq02LjFLAHv8zcwCNRg/rKdjtRH0q
MDnsVufRbK237iKxBZ5EaPRzjOIwUARjmdTC+kdWOCNCnmD4E5K7PD2BL2BO
BeQCrDZXO7C1JULRIceLibcuQzVMsvOFDlBQkk/ee3LZdDpbXA8HHBvlvIlD
VwR14PvoQirLEPIvt1i5bNDC7DLKfhtnjasoPV11AaW8MO1IKuHinazXMrH0
GPJnMAwXia3aIEcMBK3Ixe15ubimjjqNGDnZ7sdXjrxsBXLvTkquzFIJyiQT
P8+iNDCtHoSjq+ZDtruiWtbeBpIKK5iDcAqz2zCSamQ+g/BRq+TTLYGP9x7l
3jwGOLu2vOAEN9D/5JRZUWa0nU25Kbh1OdIA3OGklYAhJ1WmygWsQYnfMneO
ZGPWG1+HMCU16SzsX+FEmVULm/sGbVaIspT43Tt52ml19uC/207nlP77N/H2
9gysCUABaz/HS7BVfI69AL/HTYCajxNFahfLYGamRVscxGqsiswVs3ISPPkr
pvUF9hV4gmft6iEWk4Gj4H31GEOIcdh3ExLbKcHi1hGaJgVPIIllfxunRVld
eDgXjxU7INhJlgN1K4pikW2j4EqHyXoj7wFzlq1guh70SbfK6kulV8JWGsqO
Azxq4l1ziV6s0TLGTesDUSkjyd26AjEI03kqQUPgqqTpd0JGrCgN1uqCa6Yr
EmfCWj2Cj/fWA3ZUH55xgHYHrN2MEA6YHceVvru63mAIFi+oDQylJQdntOkZ
iKBMg2vt/PAxrtXa8aFNSCJCBhCe6wE7M9gQ5athoWE0GvHEtnJs6oFe9XgN
0eA7UiKdF4Mwv0welvMMCzvNtxRbqi4ZaQJvg1qY0N4rSqEkw9+jOTPeEduD
Ushe3192L4WiHj+it1RnpxYE75+/eHV9Jnpl/x1W/kfoWbjG5URrOTa+cjVf
d0DIz7ADEhaeyFOztRu9oYgnRnWGuSfcIlk9bDJ33IzDhR2pBa4EVGrrIN01
UEOvzUATcjK0OJufpUDvDwQN1h3hUDw8FCq2OH7pjiwO9wRWLE7lvcdZnIxN
DnVBf/iIFeHlVoP7pBEil5pcAxHoVflxYAkabYRhBEqG/nLNR1WdK+VaXSSG
rZSZNHcpHxLKpcrD6Wh5McJRmcWtlD4hD2Ade0wFwwg1s55c7Cy3G4Md+KQE
uvmRGj8hTm+aPjjbcrZsd67hqUHsMkS05GNPAIVHutuyUqwsVVL7g74T06w5
ylVnHiNWtyiznAhPh9CbVqnRgi9fHHf1CmCS5CiazmKqiqo0O9Vx8kxlWUS+
NIQJcxUNCYi422FYCz+09DrsB30P0FBSXyYcUjQlxdBHpbi5ajqjVj7TFuDs
wfZfTWdFjkgw4CxnGowrB9bHjl5M016xUO/0+1e7Rm/I20CCdxwq4MvdiiV/
Au5H/wqjCLtvUN+JGro1uFyniL3+ui9f9LQRuaiw+9YnLGy+p2CNhmBoC+Mz
bSnIqVvHzBl2IUME6cgysY1SGJyIpk43jJvN4jUXsmzbzUz/TNlR4mtyRLPl
RZq4s7uNlM7BZEolmqeUmMZ6pdueQx4+t6OSDg0xqJuizo2o9xqzzBp4a90M
hL22BbsCv/W3fwkCz381As+rCOy5WitAeL4WhJe0utgGF9LPWptICVuV1Zfi
8vwxuLyst6SE5tV8+2Zonn8zNPvOrIPOj/JX7Q7+AdB5/nh0BgXRrtSlTkC9
KdsXt0EnFAmqL6VLsjj4T51bIRJtP4ktXJFzN5ALcJb4LPQGo1SH5k0/xWUa
pJb1UFZ6h3KnCReTXzyhDrN13Ok24LEf4vfjIIncUqQzXTHHZ6UW2pR5riAG
sblcOsPrPpAdI8IiZFDKEO91UWK8gDcgTtBu8G0w5vjJmgDdAjLDpIzOzJX9
hzqm8mhzstgGHSy5paBNsZKInaAaj5/E//Mf/8kCs4Z0asDgXp4lbd6l737Y
3q82aV2M/ANMJCseBROYbnavqJR9oDY57+bAiUKHELJmdACr0sGZbummPLyJ
akxTXAZ8oMsfGLGhKChbu8zkmDu1iDMlyPMVBBOODdVM5xoCEcYEEhj8YAdW
yl13WtcQ9sjec05UZ3+XVBiQ04lETcNeV3OOmld0F5UiqbI7yfC22lgLnN9j
4ok1RnBcxsNSoygFQZppFYAxXS0KwHgtCZvEmoW/LElRfcgX7twIt/8mWiob
LWt5J2kzMl/eJDKumMZfpBaYwEp4C/F57rwLakEaoRMcLuVm4joty6nWoG0w
e0kyG1i2D+uP/PzzrZZlNkf1+tnSrPgKaWB3tWzTz6tHqk2Xm0nJXVTU3clO
/7m5I7cUQ1nWmXKWdghD4noO+LiSAbbElb3/Bosp3ar9rjclmQHYVr4QR9h2
Y27K0Z2YcjstcN1aGE+DL/ac92r8Sw0VJJCcfVgaU+lQvvRoTcRABiDkpkwS
/wsvnvQP0Xqh9Em3zNXuM5B7MaAcSVu8RHxCoRKKb7YsSbPlLiKZ9mjTt+C4
Fsi8d9S5u5F3c/Oay7oLSsBUnRbjETgXZwJzubFS03zaPvCOfNdn69xjK+6r
xlp83bnDZ3uRjca5+FI7zkpXMvZqrCPAX7w3cgNE7RCb23ve+c7t+dYdX/fE
9D44Oaa34SUsPHot/EWpdxFEJzKNwODdIjd3RR4fp4D1nSLbboRxG92bm1Mi
0QwKvUE4cWGYWPpe9qKSQ5V7KYlcILcY5BX5KkvAofnXoz78+fb6xfUpVqM4
9vIHtD/8hW4K9656lS3yheEgCR6qm8XTShSPCUL36vEA/E+c7gV171Di3JvS
9B5UmkJwpTU9QGW/7YrWtNKf0g0DG9vUdFW11kBLVyx1U2tT2xvC6KRW0vQ6
P9tLGi5wF5gw/YUNqat6NNxuVM5o45k49eFaU+pv0I7aW9taondq+iqoM4RT
7l7qyOZOJBZzES2BDc90bZUvXY+VIq7Q06fYMFILtejo0E0yU3tF4bK1zzT7
ATCDPwPrl51+He7088voJtTXRFQb6ihDZt0Yt2RdXlyOpjPuaME6s5kddjOM
MoTwjGd2Otgxi7VwuyO9Fo3Hdb49rgm4JhW6g+qX9wA/rgX40zPdAq7/5uY6
aqU9qHYAw3k7rbQ8du/wcWOPl4195LonS8YamnF9d+xJZew6mjeNXUfzprFr
aT7wxh52KmPX0rxh7FqaN4xdS7N/RoffIhubxq6lecPYCs2/uS4crdKFgyU0
Hz5u7PGysY9c92TJ2KouHK3ShTU0bxq7juZNY9fSfOCNrevCOpo3jF1L84ax
a2n2z6iuC+to3jB2Lc0bxvo0/xp7tOmmAzkUq687LHEhf9W1h21xbgs3ZbIc
g0v0TJcUdWo/KcA/ixE4lSKdIxF+sWlFhcwEd5ViMwZ1EypooXfB7SzsolAx
CxNk2BFAbldCt0LRRatVVW+5QY8oowKUTXvbBtwmdmFwBsgpndsmHfT4y8rR
R3h3qrL8ozi/OsMrFP3+lfgdVs0+fLfrVZs41KkQRgHYPV64pDu3OFg33pnC
iuPRRZktyi2t8bX1FB++WzmJX9pbPkvZvWPnCvyqWhkQm98Q4kQNRnRvsBsF
2/zeifJKm2Vcxr8hdDspzF0yJzmEq1TqykYYluVcTJjPxcwBtcauynzY6766
3gqfQNbEPwuTO9GnYL6wB/kDt3z/UK1PZCYbRUzXGYQa9cg6y6Mmz4IvOkyq
lVf8Fg3zw0wVXlL51OnjcH3yH8Q/6ZML4nv0tLF981F00lIOmaZa5ZBrenDS
O+ZCKkNJN6tNVUPL1g0nat5HyVDdi1lcZGKP+m86eBiRCZxz3dVKyYpFPVfM
eXS/KC0WMneEdB21HnPLGoUlesns7nVYM2OGrR8r6upaEdzuN3sUTb6FaViD
fdjN1cezLV6YrMJbqhRnuukmbJl0Q4tLyNkDWIpUTkEnoyQdhQ9UFnsnU8rC
tzoHCIetziHn3HCCzgH88wFF4HwYYY0d+KPnalcG7/PgA2fwPvyTBr8L0gjb
I+WSSUC68KI5spV+ZAKZVJu8y5PvO5N34Z8VyiKeyFxI92bY4xm6zgx78E+a
gdm2bv0Oj95zRmMTKa9PPfxYcOZfqyGYwx+Cym06172JvqKhi1lxyZf/dSe5
Gb6pmVyX0nRCxibnGddJlBfcIFb+DNkslS17l51x2W3M90s9VODCNcqEPs19
RlcN6jcnGBL9QkHCeWfKx7q3qiFsoLlI+OlHBWI5x+Y9kxngGxxuBmPJJRfK
+pU3ZurH55zbeqFxztP5ESv64sbU7TTLEvc3CTi11NZpO8pI9maU+vqsZw2w
LYgZbRwc69Ug/Yhq7Is4bT98hFjUQyNpf3+MAIh+rol7Q8q8HP/sLJf+CD2w
U9fgAP/UU4i/ihfLIdcDOXPoP0Oc4H4KOXy2NQI0klu6b4R/HTbju5ypvvmT
3IGt/XI2SSPYEP58yzT7+b+z7AHzWfhFkGbAU/EcG/iTxDz+o5pgt6Qsfv4v
cRnkeZYp+933P/89DRA84wDh80H/ehV8cxOMAvwd1ihpvVYz+Tf8SleholSM
QMwG9PtOCbcclz9OIeg6kar+7pf9TRds6oTtZMVMN4QOFuLdxdXV9bueLa+d
yTiPwtYV1fRShQn9TJzdXNxe9M/POB3545ub836ffzRKt7W+6na6HfO+6F+8
vOi3XimAg53v+XYRNsESMSeH3aPD7m678b+n8uq5l1gAAA==

-->

</rfc>
