<?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.30 (Ruby 3.4.8) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-sullivan-crypto-publication-00" category="bcp" consensus="true" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.31.0 -->
  <front>
    <title abbrev="Crypto Two-Lane">Two-Lane Publication Model for Cryptographic Mechanisms</title>
    <seriesInfo name="Internet-Draft" value="draft-sullivan-crypto-publication-00"/>
    <author initials="N." surname="Sullivan" fullname="Nick Sullivan">
      <organization>Cryptography Consulting LLC</organization>
      <address>
        <email>nicholas.sullivan+ietf@gmail.com</email>
      </address>
    </author>
    <date year="2026" month="March" day="02"/>
    <area>General</area>
    <workgroup/>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 67?>

<t>This document describes a repeatable publication model for
cryptographic work in the IETF.  It separates cryptographic
mechanism specifications requiring deep security
justification from protocol-oriented specifications
defining interoperability, wire formats, and registries.
It describes a dedicated working group model for
coordinating Standards Track deployment of CFRG mechanisms
and recommends use of the CFRG Crypto Review Panel to help
working groups strengthen their Security Considerations
text.</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-sullivan-crypto-publication/"/>.
      </t>
    </note>
  </front>
  <middle>
    <?line 80?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>The CFRG and IETF have developed effective collaboration patterns
for publishing cryptographic mechanisms in IETF protocols.  MLS and
HPKE, Privacy Pass and VOPRF, PPM and VDAF all follow a similar
structure: the Crypto Forum Research Group (CFRG) publishes mechanism
specifications on the IRTF stream as Informational RFCs, and IETF
working groups publish Standards Track protocol integration that
references those mechanisms.</t>
      <t>This document articulates a structured model, informed by those
collaborations, for managing the boundary between CFRG mechanism
development and IETF Standards Track deployment.  It describes
three elements: a two-lane publication model (mechanism
specification vs. protocol integration), a dedicated
working group template for coordinating Standards Track
deployment of CFRG mechanisms across multiple protocols,
and use of the CFRG Crypto Review Panel to help working
groups strengthen their Security Considerations text.</t>
      <t>In 2025, the IETF chartered the HPKE Working Group <xref target="HPKE-CHARTER"/>
to republish <xref target="RFC9180"/> on the Standards Track and define
post-quantum extensions.  This document generalizes the HPKE WG
approach into a repeatable pattern available for future mechanisms.</t>
      <t>These collaboration patterns work well when followed
deliberately.  Without deliberate coordination between
lanes, two recurring problems arise.</t>
      <section anchor="under-justified-cryptographic-decisions">
        <name>Under-Justified Cryptographic Decisions</name>
        <t>Protocol working groups sometimes duplicate or redefine
cryptographic algorithm parameters, encodings, or
constructions without CFRG-level analysis.  This happens
when a WG perceives CFRG engagement as too slow or
out-of-scope, leading to cryptographic design decisions in
Standards Track documents without security proofs, test
vectors, or independent review.  A WG that defines a
custom key derivation construction or novel nonce
generation scheme has made a cryptographic design decision
that warrants CFRG scrutiny, regardless of how
"straightforward" the construction appears.</t>
      </section>
      <section anchor="late-stage-security-surprises">
        <name>Late-Stage Security Surprises</name>
        <t>Protocol working groups sometimes discover at IETF Last
Call or IESG review that a document needs CFRG review,
when Security Considerations text is scrutinized and
assumptions about threat models, key management, or
algorithm properties diverge between cryptographic experts
and protocol engineers.  This applies across IETF areas,
not just the Security Area: any working group using
cryptographic mechanisms may encounter gaps between its
protocol expertise and the cryptographic properties it
depends on.  A document that reaches IETF Last Call
without crypto review may require Crypto Panel review
late in the process, adding months to publication and
forcing substantive design changes under time pressure.</t>
        <t>Working groups, area directors, and the Independent
Submissions Editor retain full discretion over adoption.
The normative keywords in this document describe
recommended practice for those adopting this model.</t>
        <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="terminology">
        <name>Terminology</name>
        <dl>
          <dt>Mechanism agreement:</dt>
          <dd>
            <t>The set of documents establishing that a cryptographic
mechanism is suitable for IETF use.  For CFRG-authored
mechanisms, this is a mechanism specification (algorithm
definition, security analysis, and test vectors)
published on the IRTF stream.  For externally specified
mechanisms, this is the external specification plus a
CFRG security considerations document validating the
mechanism for IETF protocol contexts.  See
<xref target="two-lane-publication-model"/> for the full definition
of Lane 1.</t>
          </dd>
          <dt>Protocol profile:</dt>
          <dd>
            <t>A Standards Track document (also called "integration
document") that defines wire formats, code points, and
protocol-specific usage for a given mechanism.  See
<xref target="two-lane-publication-model"/> for the full definition
of Lane 2.</t>
          </dd>
        </dl>
      </section>
    </section>
    <section anchor="two-lane-publication-model">
      <name>Two-Lane Publication Model</name>
      <t>The two-lane publication model separates cryptographic work into two
tracks.  This separation follows the principle of companion algorithm
documents recommended in <xref target="RFC7696"/> (BCP 201): base protocol
specifications reference separate algorithm documents, allowing either
to evolve independently.</t>
      <section anchor="lane-1-mechanism-agreement">
        <name>Lane 1: Mechanism Agreement</name>
        <t>Lane 1 establishes that a cryptographic mechanism is suitable
for IETF protocol use.  Two paths through Lane 1 exist,
depending on where the mechanism originates.</t>
        <section anchor="cfrg-authored-specification">
          <name>CFRG-Authored Specification</name>
          <t>When CFRG develops a mechanism, it publishes a mechanism
specification on the IRTF stream as an Informational RFC.  This
document defines the cryptographic algorithm, construction, or
primitive.  It includes algorithm definition with complete
mathematical description, security rationale with proofs or
references to security analyses, test vectors for all specified
operations, and implementation guidance covering known pitfalls.</t>
          <t>A mechanism specification does not include protocol wire formats or
encodings, protocol-specific code point assignments (TLS
SignatureScheme values, JOSE algorithm names, etc.), negotiation
mechanisms, or integration with specific protocol frameworks.  This
boundary ensures the mechanism specification can serve multiple
protocols without revision, and that protocol changes do not require
cryptographic re-analysis.</t>
          <t>Example: <xref target="RFC8032"/> defines EdDSA as a signature scheme over twisted
Edwards curves.  It includes the algorithm, security analysis, and test
vectors.  It does not define JOSE or PKIX encodings.</t>
        </section>
        <section anchor="externally-specified-mechanisms">
          <name>Externally Specified Mechanisms</name>
          <t>When a mechanism is specified through an external open process
with extensive public cryptanalysis (e.g., NIST post-quantum
competitions), CFRG does not need to respecify the algorithm.
The external specification provides the unambiguous definition;
CFRG validates security properties for IETF use cases.  Lane 2
work may proceed in parallel with CFRG validation (see
<xref target="timing-models"/>).</t>
          <t>Two validation paths exist, depending on how many
instantiations are under consideration:</t>
          <dl>
            <dt>CFRG security considerations document:</dt>
            <dd>
              <t>When multiple instantiations of a mechanism type are
candidates for IETF use, CFRG may adopt the topic of
that mechanism type's use in the requested setting.
The resulting document studies the set of suitable
instantiations, analyzing assumptions about key
management, composition with other primitives, known
limitations, and parameter guidance without duplicating
the external specifications.</t>
            </dd>
            <dt>Crypto Panel review:</dt>
            <dd>
              <t>When a single instantiation is under consideration,
Crypto Panel review
(<xref target="cfrg-crypto-review-panel"/>) of the working group's
profile document is sufficient.  A full CFRG security
considerations document is not required.</t>
            </dd>
          </dl>
          <t>In some cases, CFRG adoption of the security considerations
topic is sufficient for Lane 2 work to proceed; publication
is not a prerequisite.  Lane 2 authors coordinate with the
evolving CFRG document on changes and test vectors.</t>
        </section>
        <section anchor="mechanism-registries">
          <name>Mechanism Registries</name>
          <t>Mechanism specifications <bcp14>SHOULD NOT</bcp14> create IANA registries.  Two
categories of registries exist, with different ownership models:</t>
          <dl>
            <dt>Mechanism-level registries:</dt>
            <dd>
              <t>Algorithm identifiers that must be consistent across all consuming
protocols.  Example: HPKE's KEM, KDF, and AEAD suite identifiers.
These are unavoidable when the mechanism itself defines
parameterized constructions.</t>
            </dd>
            <dt>Protocol-specific registries:</dt>
            <dd>
              <t>Code points within a particular protocol's namespace.  Example:
TLS SignatureScheme values, JOSE algorithm names, COSE algorithm
identifiers.  These belong in protocol profile documents, not
mechanism specifications.</t>
            </dd>
          </dl>
          <t>When mechanism-level registries exist, a dedicated WG or
consuming protocol provides the long-term maintenance
path on the Standards Track.  See
<xref target="iana-considerations-placement"/> for guidance on
registry ownership and errata resolution.</t>
        </section>
      </section>
      <section anchor="lane-2-protocol-profiles-ietf-stream">
        <name>Lane 2: Protocol Profiles (IETF Stream)</name>
        <t>Lane 2 produces Standards Track documents that make a mechanism usable
in IETF protocols.  The choice depends on scope and novelty:</t>
        <figure anchor="fig-decision-tree">
          <name>Lane 2 decision tree</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="624" width="456" viewBox="0 0 456 624" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,208 L 8,256" fill="none" stroke="black"/>
                <path d="M 48,304 L 48,320" fill="none" stroke="black"/>
                <path d="M 56,80 L 56,128" fill="none" stroke="black"/>
                <path d="M 104,176 L 104,200" fill="none" stroke="black"/>
                <path d="M 144,304 L 144,320" fill="none" stroke="black"/>
                <path d="M 168,48 L 168,72" fill="none" stroke="black"/>
                <path d="M 184,560 L 184,568" fill="none" stroke="black"/>
                <path d="M 200,208 L 200,256" fill="none" stroke="black"/>
                <path d="M 224,208 L 224,256" fill="none" stroke="black"/>
                <path d="M 224,432 L 224,448" fill="none" stroke="black"/>
                <path d="M 224,480 L 224,496" fill="none" stroke="black"/>
                <path d="M 248,176 L 248,200" fill="none" stroke="black"/>
                <path d="M 264,304 L 264,320" fill="none" stroke="black"/>
                <path d="M 264,416 L 264,432" fill="none" stroke="black"/>
                <path d="M 296,80 L 296,128" fill="none" stroke="black"/>
                <path d="M 304,432 L 304,448" fill="none" stroke="black"/>
                <path d="M 304,480 L 304,496" fill="none" stroke="black"/>
                <path d="M 376,304 L 376,320" fill="none" stroke="black"/>
                <path d="M 416,208 L 416,256" fill="none" stroke="black"/>
                <path d="M 56,80 L 296,80" fill="none" stroke="black"/>
                <path d="M 56,128 L 296,128" fill="none" stroke="black"/>
                <path d="M 8,208 L 200,208" fill="none" stroke="black"/>
                <path d="M 224,208 L 416,208" fill="none" stroke="black"/>
                <path d="M 8,256 L 200,256" fill="none" stroke="black"/>
                <path d="M 224,256 L 416,256" fill="none" stroke="black"/>
                <path d="M 224,432 L 304,432" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="384,320 372,314.4 372,325.6" fill="black" transform="rotate(90,376,320)"/>
                <polygon class="arrowhead" points="312,496 300,490.4 300,501.6" fill="black" transform="rotate(90,304,496)"/>
                <polygon class="arrowhead" points="272,320 260,314.4 260,325.6" fill="black" transform="rotate(90,264,320)"/>
                <polygon class="arrowhead" points="256,200 244,194.4 244,205.6" fill="black" transform="rotate(90,248,200)"/>
                <polygon class="arrowhead" points="232,496 220,490.4 220,501.6" fill="black" transform="rotate(90,224,496)"/>
                <polygon class="arrowhead" points="176,72 164,66.4 164,77.6" fill="black" transform="rotate(90,168,72)"/>
                <polygon class="arrowhead" points="152,320 140,314.4 140,325.6" fill="black" transform="rotate(90,144,320)"/>
                <polygon class="arrowhead" points="112,200 100,194.4 100,205.6" fill="black" transform="rotate(90,104,200)"/>
                <polygon class="arrowhead" points="56,320 44,314.4 44,325.6" fill="black" transform="rotate(90,48,320)"/>
                <g class="text">
                  <text x="60" y="36">WG</text>
                  <text x="96" y="36">needs</text>
                  <text x="128" y="36">a</text>
                  <text x="192" y="36">cryptographic</text>
                  <text x="288" y="36">mechanism</text>
                  <text x="120" y="100">CFRG-reviewed</text>
                  <text x="216" y="100">mechanism</text>
                  <text x="108" y="116">available?</text>
                  <text x="104" y="148">|</text>
                  <text x="248" y="148">|</text>
                  <text x="108" y="164">NO</text>
                  <text x="256" y="164">YES</text>
                  <text x="28" y="228">Do</text>
                  <text x="64" y="228">other</text>
                  <text x="116" y="228">groups</text>
                  <text x="164" y="228">need</text>
                  <text x="264" y="228">Already</text>
                  <text x="308" y="228">on</text>
                  <text x="336" y="228">the</text>
                  <text x="32" y="244">the</text>
                  <text x="68" y="244">same</text>
                  <text x="132" y="244">primitive?</text>
                  <text x="272" y="244">Standards</text>
                  <text x="340" y="244">Track?</text>
                  <text x="48" y="276">|</text>
                  <text x="144" y="276">|</text>
                  <text x="264" y="276">|</text>
                  <text x="376" y="276">|</text>
                  <text x="52" y="292">NO</text>
                  <text x="144" y="292">YES</text>
                  <text x="260" y="292">NO</text>
                  <text x="376" y="292">YES</text>
                  <text x="12" y="340">WG</text>
                  <text x="36" y="340">or</text>
                  <text x="116" y="340">Form</text>
                  <text x="144" y="340">a</text>
                  <text x="236" y="340">Should</text>
                  <text x="276" y="340">it</text>
                  <text x="300" y="340">be</text>
                  <text x="352" y="340">Write</text>
                  <text x="412" y="340">profiles</text>
                  <text x="44" y="356">individual</text>
                  <text x="136" y="356">dedicated</text>
                  <text x="244" y="356">promoted</text>
                  <text x="292" y="356">to</text>
                  <text x="376" y="356">referencing</text>
                  <text x="28" y="372">drives</text>
                  <text x="108" y="372">WG</text>
                  <text x="236" y="372">Stds</text>
                  <text x="284" y="372">Track?</text>
                  <text x="356" y="372">Stds</text>
                  <text x="400" y="372">Track</text>
                  <text x="440" y="372">RFC</text>
                  <text x="36" y="388">parallel</text>
                  <text x="20" y="404">work</text>
                  <text x="60" y="404">with</text>
                  <text x="20" y="420">CFRG</text>
                  <text x="224" y="468">YES</text>
                  <text x="300" y="468">NO</text>
                  <text x="216" y="516">Dedicated</text>
                  <text x="308" y="516">Approved</text>
                  <text x="188" y="532">WG</text>
                  <text x="304" y="532">downref</text>
                  <text x="344" y="532">+</text>
                  <text x="224" y="548">republishes</text>
                  <text x="308" y="548">profiles</text>
                  <text x="360" y="548">via</text>
                  <text x="228" y="564">profiles</text>
                  <text x="308" y="564">existing</text>
                  <text x="356" y="564">WG</text>
                  <text x="380" y="564">or</text>
                  <text x="216" y="580">(default)</text>
                  <text x="316" y="580">individual</text>
                  <text x="316" y="596">submission</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
        WG needs a cryptographic mechanism
                      |
                      v
        +-----------------------------+
        | CFRG-reviewed mechanism     |
        | available?                  |
        +-----------------------------+
              |                 |
              NO                YES
              |                 |
              v                 v
  +-----------------------+  +-----------------------+
  | Do other groups need  |  | Already on the        |
  | the same primitive?   |  | Standards Track?      |
  +-----------------------+  +-----------------------+
       |           |              |             |
       NO         YES            NO            YES
       |           |              |             |
       v           v              v             v
  WG or       Form a        Should it be   Write profiles
  individual  dedicated     promoted to    referencing
  drives      WG             Stds Track?    Stds Track RFC
  parallel
  work with
  CFRG                            |
                             +----+----+
                             |         |
                            YES       NO
                             |         |
                             v         v
                        Dedicated   Approved
                        WG          downref +
                        republishes profiles via
                        + profiles  existing WG or
                        (default)   individual
                                    submission
]]></artwork>
          </artset>
        </figure>
        <t>"CFRG-reviewed" in <xref target="fig-decision-tree"/> includes both
mechanisms that CFRG itself produced and externally specified
algorithms that CFRG has validated for IETF use cases.  For
externally specified algorithms, CFRG validates security
properties for IETF protocol contexts without respecifying
the algorithm.  See <xref target="externally-specified-mechanisms"/>.</t>
        <section anchor="existing-wg-adoption">
          <name>Existing WG Adoption</name>
          <t>When an existing working group is the primary consumer of a mechanism
and cross-area coordination is minimal, that WG may adopt both the
mechanism republication and its protocol profile.  The WG requests
Crypto Panel review to cover cryptographic aspects outside its core
expertise.  This avoids creating a new WG while keeping work within
established IETF process.</t>
        </section>
        <section anchor="individual-submission">
          <name>Individual Submission</name>
          <t>When no existing working group covers the protocol domain, an
individual submission produces a profile without forming a working
group.  Two paths exist depending on the target stream:</t>
          <ul spacing="normal">
            <li>
              <t>AD-sponsored: The responsible AD sponsors a Standards Track
profile through IESG review.  The author requests CFRG Crypto
Review Panel analysis.</t>
            </li>
            <li>
              <t>ISE: The Independent Submissions Editor sponsors an
Informational profile on the Independent stream.  This path
is appropriate for regional or special-purpose profiles
(e.g., regionally mandated algorithm suites) that do not target the
Standards Track.</t>
            </li>
          </ul>
          <t>Independent submissions generally cannot create IANA
registries; profiles on the Independent stream reference
existing registry entries rather than creating new ones.
This is the lightest-weight path for narrow-scope work.</t>
        </section>
        <section anchor="dedicated-wgs">
          <name>Dedicated Working Groups</name>
          <t>When multiple protocols across areas need the mechanism, a
dedicated working group coordinates Standards Track
integration.  The WG republishes the mechanism on the
Standards Track, incorporating errata and implementation
experience, and coordinates per-protocol profile documents
that allocate code points in protocol-specific registries.</t>
          <t>A dedicated WG is typically warranted when three or more
protocol domains need profiles (e.g., TLS,
JOSE, COSE, PKIX), the scope is bounded with clear
technical consensus, and cross-area coordination justifies
a dedicated venue.</t>
          <t>Proponents may propose charters through existing dispatch
mechanisms
(<xref target="RFC7957"/>, secdispatch).  A BoF <xref target="RFC5434"/> is not required if ADs
and relevant WG chairs agree the work is uncontroversial
and scope is well-defined.  The responsible AD determines
the appropriate path: a BoF for complex or controversial
scope, dispatch through secdispatch, or direct charter
sponsorship (<xref target="RFC3710"/>).</t>
          <t>The charter <bcp14>MUST</bcp14> reference the specific mechanism
specification being profiled and enumerate the protocol
domains in scope (e.g., "TLS code points and PKIX
encodings for X").  It <bcp14>MUST</bcp14> state explicit non-goals
(e.g., "this WG will not redesign the cryptographic
mechanism") and include a scope lock prohibiting expansion.
The timeline <bcp14>SHOULD</bcp14> be aggressive: 12-18 months.</t>
          <t>The WG exists to publish, not to redesign.  The charter
may permit targeted changes based on implementation
experience: resolving errata, removing unused features,
aligning with IETF formatting requirements.</t>
          <t>The WG <bcp14>SHOULD</bcp14> maintain a registry of consuming WGs and
their profile requirements to ensure complete coverage.
The charter <bcp14>SHOULD</bcp14> include a sunset clause: the WG closes
upon completing its enumerated deliverables.</t>
          <section anchor="example-hpke">
            <name>Example: HPKE</name>
            <t>The HPKE Working Group, chartered in 2025 <xref target="HPKE-CHARTER"/>,
serves as the first instance of this pattern.  It was
chartered without a BoF, with AD sponsorship, to republish
<xref target="RFC9180"/> on the Standards Track and define post-quantum
algorithm suites.  The WG uses the consolidated approach:
a single Standards Track document that is both the mechanism
republication and the registry definition for consuming
protocols.  The charter explicitly constrained scope,
excluding redesign of the HPKE mechanism itself.</t>
            <t>See <xref target="appendix-charter"/> for a sample charter template.</t>
          </section>
        </section>
        <section anchor="timing-models">
          <name>Timing Models</name>
          <t>Regardless of which Lane 2 approach is used, two timing models
exist for when profile work begins:</t>
          <dl>
            <dt>Post-publication:</dt>
            <dd>
              <t>The mechanism RFC exists before profile work starts.  This
avoids coordination risk and leads to tighter alignment
between CFRG and IETF milestones, resulting in more
predictable timelines.</t>
            </dd>
            <dt>Parallel:</dt>
            <dd>
              <t>Profile work begins while CFRG is still developing the
mechanism.  This carries coordination risk: if the mechanism
changes, profile work may need revision.  ADs considering
parallel work should assess mechanism stability with CFRG
chairs before proceeding.  Profiles cannot publish until the
mechanism RFC exists (normative reference), but can reach
IESG review shortly after.</t>
            </dd>
          </dl>
        </section>
        <section anchor="profile-document-contents">
          <name>Profile Document Contents</name>
          <t>Regardless of which approach produces it, a protocol profile
integrates the mechanism into a specific protocol context:</t>
          <ul spacing="normal">
            <li>
              <t>Wire format definitions (byte layouts, ASN.1 modules, JSON
structures)</t>
            </li>
            <li>
              <t>IANA code point assignments for that protocol's registries</t>
            </li>
            <li>
              <t>Negotiation and algorithm selection mechanisms</t>
            </li>
            <li>
              <t>Normative reference to the mechanism specification</t>
            </li>
            <li>
              <t>Protocol-specific security considerations</t>
            </li>
          </ul>
          <t>A protocol profile runs 5-15 pages.  It normatively references the
mechanism specification and focuses on interoperability within its
protocol domain.</t>
          <t>Examples: <xref target="RFC8037"/> defines JOSE encodings for EdDSA.  <xref target="RFC8410"/>
defines PKIX encodings.  Both reference <xref target="RFC8032"/> and are Standards
Track.</t>
        </section>
        <section anchor="entry-criteria">
          <name>Entry Criteria</name>
          <t>Two situations trigger this coordination path, depending on
whether the mechanism already exists.</t>
          <dl>
            <dt>Republication of an existing CFRG mechanism:</dt>
            <dd>
              <t>A published CFRG mechanism is a candidate for Standards
Track promotion when it is referenced as a de facto
standard by
multiple IETF Standards Track protocols and has verified
errata with security or functionality impact.  When both
conditions hold, Standards Track republication is warranted.
When only the first holds, the Downref Registry may suffice.
When only the second holds, a CFRG -bis revision may be
more appropriate.</t>
            </dd>
            <dt>New mechanism requiring Standards Track integration:</dt>
            <dd>
              <t>When CFRG has adopted a mechanism topic and multiple
protocols have expressed integration intent, the
coordination path described here sequences parallel
Lane 2 work.  ADs considering parallel work should
assess mechanism stability with CFRG chairs before
proceeding.</t>
            </dd>
          </dl>
        </section>
        <section anchor="scope">
          <name>Scope</name>
          <t>Scope depends on the mechanism's condition:</t>
          <dl>
            <dt>Clean mechanism (no blocking errata, ready for deployment):</dt>
            <dd>
              <t>The coordination effort produces Standards Track profiles
and optionally republishes the mechanism for status
alignment.  Republication eliminates downref requirements
but is not mandatory if profiles can reference the
Informational RFC directly.</t>
            </dd>
            <dt>Mechanism with accumulated technical debt (unresolved errata,</dt>
            <dd>
              <t/>
            </dd>
            <dt>ambiguities, implementation divergence):</dt>
            <dd>
              <t>The effort republishes the mechanism on the Standards Track
with fixes, then produces updated profiles.  The CFRG
Crypto Review Panel validates that fixes preserve
cryptographic properties.  Consuming WGs coordinate
reference updates.</t>
            </dd>
          </dl>
          <t>Example: An EdDSA coordination effort could resolve
<xref target="RFC8032"/>'s cofactor ambiguity, incorporate held errata,
and produce a Standards Track specification that consuming
protocols reference.</t>
          <t>The scope <bcp14>MUST NOT</bcp14> permit new cryptographic modes or
substantial algorithm modifications.  Profile work may
involve updating recommended code points in alignment with
ongoing or completed CFRG work, or with Crypto Panel review.
Protocol profiles may include design decisions specific to
integration (parameter restrictions, serialization choices,
negotiation strategies).  These protocol-level design
decisions are in scope; changes to the underlying
cryptographic mechanism are not.</t>
        </section>
      </section>
      <section anchor="coordination-between-lanes">
        <name>Coordination Between Lanes</name>
        <t>The two-lane model requires a coordination point between CFRG
(upstream mechanism owner) and the protocols that consume the
mechanism (downstream integrators).  For a dedicated
working group, the WG fills this role.  For existing WG
adoption, that WG does.  For an individual submission,
the author and sponsoring AD coordinate directly.</t>
        <dl>
          <dt>Upstream coordination with CFRG:</dt>
          <dd>
            <t>The coordination point is the single contact for errata
resolution, ambiguity clarification, and mechanism updates.
CFRG addresses technical questions once rather than
responding to N consuming protocols independently.</t>
          </dd>
          <dt>Downstream coordination with consumers:</dt>
          <dd>
            <t>Protocols that need code points or profiles register those
needs with the coordination point, which sequences work:
mechanism republication first, then profiles in parallel.
This aligns timelines so consumers can plan milestones
around the mechanism's Standards Track availability rather
than managing independent downref approvals.</t>
          </dd>
        </dl>
        <t>Coordination mechanisms include cross-posted review requests,
cross-area review discussions, and inviting chairs or
designees of consuming WGs to participate.</t>
        <t>The two-lane separation also raises practical questions about
normative references, registry ownership, errata resolution,
and change control.  The following subsections address these.</t>
      </section>
      <section anchor="normative-reference-rules">
        <name>Normative Reference Rules</name>
        <t>Protocol profiles normatively reference mechanism specifications.  When
the mechanism specification is Informational or Experimental (IRTF
stream), this creates a downward reference (downref) as defined in
<xref target="RFC3967"/>.  The IETF maintains a Downref Registry and established
IESG procedures that handle individual downrefs adequately.</t>
        <t>A side-effect of the two-lane model is reducing the number of downref
exceptions.  When a mechanism is republished on the Standards Track,
subsequent protocol profiles reference the Standards Track version
with no downref required.  This is not a driving motivation for the
model, but a measurable signal that it reduces coordination overhead.</t>
        <t>Two resolution paths exist:</t>
        <ul spacing="normal">
          <li>
            <t>Approved downref: The IESG approves the downref and adds it to the
Downref Registry.  This is appropriate when the mechanism is stable,
widely reviewed, and referenced by few Standards Track documents.</t>
          </li>
          <li>
            <t>Standards Track republication: A dedicated WG
(<xref target="entry-criteria"/>)
republishes the mechanism on the Standards Track, eliminating the
downref for all current and future consumers.  This is appropriate
when the mechanism is widely referenced as a de facto standard.</t>
          </li>
        </ul>
      </section>
      <section anchor="iana-considerations-placement">
        <name>IANA Considerations Placement</name>
        <section anchor="registry-ownership">
          <name>Registry Ownership</name>
          <t>While IRTF documents can create IANA registries, CFRG is not
well-positioned for long-term document maintenance.  CFRG's value is
cryptographic analysis: security proofs, parameter validation,
construction review.  Registry administration is not.</t>
          <t>Protocol-specific registries belong in profile documents, not mechanism
specifications.  Registry ownership depends on the publication approach.
A dedicated WG may consolidate all registries (mechanism-level and
protocol code points) in a single Standards Track document, or
coordinate separate profile documents where each consuming protocol
maintains its own registry allocations.  When mechanism-level registries
exist in CFRG documents, a dedicated WG or consuming protocol provides
the maintenance path on the Standards Track.  The mechanics of
transferring registry ownership from an IRTF document to a Standards
Track document should be confirmed with IANA; the HPKE WG
<xref target="HPKE-CHARTER"/> provides an example.  See
<xref target="dedicated-wgs"/> for charter guidance.</t>
        </section>
        <section anchor="errata-and-maintenance">
          <name>Errata and Maintenance</name>
          <t>Informational RFCs accumulate errata marked "Hold for Document Update"
<xref target="I-D.rpc-errata-process"/>.  CFRG can publish -bis revisions as
Informational to address these.  The Standards Track path provides an
alternative with additional benefits: clear document ownership,
established IETF maintenance procedures, and elimination of downref
requirements for consuming protocols.</t>
          <t>The model provides a decision framework for when each path is
appropriate.  A mechanism that is referenced as a de facto standard
by multiple IETF Standards Track protocols and has verified errata
with security or functionality impact is a candidate for
Standards Track promotion.  See <xref target="entry-criteria"/> for
entry criteria.</t>
          <t><xref target="RFC9180"/> (HPKE) and <xref target="RFC8554"/> (LMS) are CFRG documents that
created IANA registries.  HPKE is now being retrofitted: the HPKE
WG <xref target="HPKE-CHARTER"/> is republishing it on the Standards Track,
taking over registry ownership and providing a clear home for code
point allocation as post-quantum suites are added.</t>
        </section>
      </section>
      <section anchor="change-control-boundaries">
        <name>Change Control Boundaries</name>
        <t>When a mechanism is republished on the Standards Track, the IETF owns
the resulting document and any subsequent revisions.  CFRG retains
cryptographic review authority: substantive changes to the algorithm
or security properties require CFRG Crypto Review Panel analysis
before IETF publication.  This division places document maintenance
(errata resolution, bis revisions) within IETF process while ensuring
cryptographic expertise guides substantive changes.</t>
        <t>Protocol working groups own protocol profile evolution: code point
assignments, wire format changes, and integration updates.
Cryptographic expertise stays with CFRG.  Protocol-specific details
stay with domain experts.</t>
      </section>
    </section>
    <section anchor="cfrg-crypto-review-panel">
      <name>CFRG Crypto Review Panel</name>
      <t>The CFRG maintains a Crypto Review Panel <xref target="CFRG-PANEL"/> that provides
expert cryptographic analysis for documents across the
IETF and IRTF.  The panel's members are primarily
external cryptographic
experts who bring independent analytical capability.
While primarily used by Security Area working groups,
the panel is available to any WG whose documents include
cryptographic mechanisms.</t>
      <t>To request review, an AD, WG chair, or author contacts the CFRG
chairs, who assign a panel reviewer based on the document's
cryptographic content.  The ISE may also request review for
independent submissions.  Panel findings do not bind the
WG or responsible AD, who decide how to address them.  The
responsible AD determines whether Crypto Panel review
is needed before IESG approval, based on cryptographic
complexity.</t>
      <t>If the panel demonstrates consistent value under increased use, the
community may explore further organizational support (such as
published membership rosters, documented review procedures, or
datatracker integration) to sustain review capacity.</t>
      <section anchor="what-is-reviewed">
        <name>What Is Reviewed</name>
        <t>The panel focuses on cryptographic correctness and appropriateness,
not general protocol design.  Review areas include:</t>
        <ul spacing="normal">
          <li>
            <t>Cryptographic justification for algorithm choices</t>
          </li>
          <li>
            <t>Security Considerations text covering algorithm-specific risks</t>
          </li>
          <li>
            <t>Correctness of algorithm usage (modes, parameters, contexts)</t>
          </li>
          <li>
            <t>Parameter choices (key sizes, nonce handling, iteration counts)</t>
          </li>
          <li>
            <t>Composition of primitives (KDF chains, AEAD usage, etc.)</t>
          </li>
          <li>
            <t>Externally specified algorithms proposed for IETF use: validating
that security claims hold in IETF protocol contexts</t>
          </li>
        </ul>
        <t>The panel does not duplicate Security Area Directorate review.
Working groups may request targeted reviews of specific cryptographic
usage (e.g., "review our use of HKDF in this context") without
requiring a full document review.</t>
      </section>
      <section anchor="requesting-review">
        <name>Requesting Review</name>
        <t>Review is warranted when a draft defines cryptographic behavior
beyond what existing CFRG specifications cover: novel constructions,
non-standard parameter choices, or security claims that rely on
unanalyzed cryptographic properties.  Review is generally not needed
when a draft uses CFRG-published mechanisms as specified, defining
only wire formats, code points, or protocol integration.</t>
        <t>Working groups <bcp14>SHOULD</bcp14> request review before WG Last Call, ideally
when the Security Considerations section nears completion.  The
panel targets 2-4 weeks for review completion.  WGs introducing
novel cryptographic constructions should consult the panel during
design, not after.  <xref target="appendix-checklist"/> provides a complete
pre-WG-Last-Call checklist.</t>
        <t>The WG documents the disposition of each finding (accepted, rejected
with rationale, or overtaken by design changes).  The Crypto Panel
may recommend routing a document through CFRG if the work involves
novel mechanisms requiring deeper research community review.</t>
      </section>
    </section>
    <section anchor="national-crypto">
      <name>National Cryptography</name>
      <t>The two-lane model applies to all cryptographic mechanisms.
This section addresses algorithms that have not undergone
broad open international review and whose adoption is
primarily driven by regulatory compliance.</t>
      <section anchor="definition">
        <name>Definition</name>
        <t>This section uses the term "national cryptography" as shorthand
for algorithms where:</t>
        <ul spacing="normal">
          <li>
            <t>Public cryptanalysis and independent review are limited
relative to algorithms selected through open international
processes</t>
          </li>
          <li>
            <t>Adoption is driven by regulatory compliance in a specific
jurisdiction rather than broad cryptographic community
consensus</t>
          </li>
        </ul>
        <t>Algorithms that have undergone extensive public review enter
IETF protocols through the main flowchart path
(<xref target="fig-decision-tree"/>).  The guardrails below apply to
algorithms that have not.</t>
      </section>
      <section anchor="risks-and-challenges">
        <name>Risks and Challenges</name>
        <t>Algorithms in this category create tension between regional
regulatory compliance and global protocol interoperability.
When a regulator mandates algorithm X for domestic
deployments, the IETF must decide whether and how to
accommodate X without fragmenting the global protocol
baseline.</t>
        <t>Incorporating such algorithms without sufficient safeguards
produces four problems.  First, regulatory mandates create
compliance pressure that overrides global interoperability,
fragmenting protocols into regional variants.  Second,
algorithms without extensive public cryptanalysis carry higher
risk of undiscovered weaknesses.  Third, algorithms with
limited global deployment inflate IANA registries and increase
implementation complexity for marginal benefit.  Fourth,
algorithms perceived as government-controlled raise concerns
about backdoors regardless of technical merit.</t>
        <t>These risks motivate the guardrails below.</t>
      </section>
      <section anchor="guardrails-and-best-practices">
        <name>Guardrails and Best Practices</name>
        <t>The following practices manage the risks above while preserving
regional extensibility.  These guardrails are process-based: they
apply to any algorithm that has not undergone broad open
international review, regardless of origin.  Algorithms that
have undergone extensive public review enter through the main
path (<xref target="fig-decision-tree"/>).  Algorithms without such review
appear in separate optional profile
documents that reference the algorithm's authoritative
specification (whether a national standard, an Informational
RFC, or an independent submission).  They do not modify core
protocol specifications or base mechanism documents.</t>
        <dl>
          <dt>Optional profiles:</dt>
          <dd>
            <t>Algorithms without broad international review <bcp14>SHOULD</bcp14> be specified
in separate optional profile documents, not embedded in core
protocol specifications.  This preserves a globally interoperable
baseline while allowing regional extensions.  <xref target="RFC8998"/>
is an example of this pattern for TLS 1.3 <xref target="RFC8446"/>.</t>
          </dd>
          <dt>Recommendation marking:</dt>
          <dd>
            <t>Where IANA registries include a "Recommended" column, working
groups <bcp14>MAY</bcp14> choose to only recommend algorithms that have CFRG
approval.  See <xref target="RFC9367"/> for an example.</t>
          </dd>
          <dt>Registry policy:</dt>
          <dd>
            <t>Registries for cryptographic algorithms <bcp14>SHOULD</bcp14> maintain
"RFC Required" or "Specification Required" <xref target="RFC8126"/> policies with
designated expert review.  Early allocation and private use ranges
mitigate pressure for premature standardization.</t>
          </dd>
          <dt>Crypto Panel review required:</dt>
          <dd>
            <t>Algorithms entering through this path <bcp14>MUST</bcp14> receive Crypto Panel
review.  Lack of public cryptanalysis is grounds for rejection
or marking as Not Recommended.</t>
          </dd>
          <dt>Code point coordination:</dt>
          <dd>
            <t>Algorithms appearing in multiple protocols <bcp14>SHOULD</bcp14> coordinate
all registrations together to avoid redundant or conflicting
identifiers.</t>
          </dd>
        </dl>
      </section>
      <section anchor="example-nist-post-quantum-algorithms">
        <name>Example: NIST Post-Quantum Algorithms</name>
        <t>Algorithms selected through open international competitions with
extensive public cryptanalysis illustrate the main-path model for
well-reviewed external algorithms.  Such algorithms enter IETF
protocols through the main flowchart path
(<xref target="fig-decision-tree"/>): externally specified, CFRG-reviewed via
security considerations documents, then working groups write
protocol profiles.  The guardrails in this section do not apply
because these algorithms have undergone extensive public review.</t>
      </section>
      <section anchor="neutral-language">
        <name>Neutral Language</name>
        <t>Documents involving algorithms in this category <bcp14>MUST</bcp14> use neutral,
technical language focused on interoperability and security
properties.  Political or geopolitical framing is inappropriate.
Factual statements about algorithm provenance, standardization
body, and public analysis status are acceptable and encouraged
for transparency.</t>
      </section>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>This document defines processes and best practices; it does not specify
protocols or cryptographic algorithms directly.</t>
      <t>The two-lane model is designed to improve security outcomes by
routing cryptographic mechanisms through focused expert review in
CFRG while protocol integration receives appropriate review in
working groups.  Separating these concerns is intended to reduce
the risk of cryptographic errors during protocol design and
provide a structured path for applying CFRG Crypto Review Panel
expertise to documents across the IETF and IRTF.</t>
      <t>Concentrating cryptographic review in a small panel creates process
risks: reviewer availability can bottleneck publication, and a narrow
reviewer pool may develop blind spots.  Mitigations include maintaining
diverse panel membership, publishing review criteria, and preserving AD
discretion to proceed when panel review is unavailable or disputed.</t>
    </section>
    <section anchor="iana-considerations">
      <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="RFC7696">
          <front>
            <title>Guidelines for Cryptographic Algorithm Agility and Selecting Mandatory-to-Implement Algorithms</title>
            <author fullname="R. Housley" initials="R." surname="Housley"/>
            <date month="November" year="2015"/>
            <abstract>
              <t>Many IETF protocols use cryptographic algorithms to provide confidentiality, integrity, authentication, or digital signature. Communicating peers must support a common set of cryptographic algorithms for these mechanisms to work properly. This memo provides guidelines to ensure that protocols have the ability to migrate from one mandatory-to-implement algorithm suite to another over time.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="201"/>
          <seriesInfo name="RFC" value="7696"/>
          <seriesInfo name="DOI" value="10.17487/RFC7696"/>
        </reference>
        <reference anchor="RFC8126">
          <front>
            <title>Guidelines for Writing an IANA Considerations Section in RFCs</title>
            <author fullname="M. Cotton" initials="M." surname="Cotton"/>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <author fullname="T. Narten" initials="T." surname="Narten"/>
            <date month="June" year="2017"/>
            <abstract>
              <t>Many protocols make use of points of extensibility that use constants to identify various protocol parameters. To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper. For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA).</t>
              <t>To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed. This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry.</t>
              <t>This is the third edition of this document; it obsoletes RFC 5226.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="26"/>
          <seriesInfo name="RFC" value="8126"/>
          <seriesInfo name="DOI" value="10.17487/RFC8126"/>
        </reference>
        <reference anchor="RFC3967">
          <front>
            <title>Clarifying when Standards Track Documents may Refer Normatively to Documents at a Lower Level</title>
            <author fullname="R. Bush" initials="R." surname="Bush"/>
            <author fullname="T. Narten" initials="T." surname="Narten"/>
            <date month="December" year="2004"/>
            <abstract>
              <t>IETF procedures generally require that a standards track RFC may not have a normative reference to another standards track document at a lower maturity level or to a non standards track specification (other than specifications from other standards bodies). For example, a standards track document may not have a normative reference to an informational RFC. Exceptions to this rule are sometimes needed as the IETF uses informational RFCs to describe non-IETF standards or IETF-specific modes of use of such standards. This document clarifies and updates the procedure used in these circumstances. 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="97"/>
          <seriesInfo name="RFC" value="3967"/>
          <seriesInfo name="DOI" value="10.17487/RFC3967"/>
        </reference>
        <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="RFC9180">
          <front>
            <title>Hybrid Public Key Encryption</title>
            <author fullname="R. Barnes" initials="R." surname="Barnes"/>
            <author fullname="K. Bhargavan" initials="K." surname="Bhargavan"/>
            <author fullname="B. Lipp" initials="B." surname="Lipp"/>
            <author fullname="C. Wood" initials="C." surname="Wood"/>
            <date month="February" year="2022"/>
            <abstract>
              <t>This document describes a scheme for hybrid public key encryption (HPKE). This scheme provides a variant of public key encryption of arbitrary-sized plaintexts for a recipient public key. It also includes three authenticated variants, including one that authenticates possession of a pre-shared key and two optional ones that authenticate possession of a key encapsulation mechanism (KEM) private key. HPKE works for any combination of an asymmetric KEM, key derivation function (KDF), and authenticated encryption with additional data (AEAD) encryption function. Some authenticated variants may not be supported by all KEMs. We provide instantiations of the scheme using widely used and efficient primitives, such as Elliptic Curve Diffie-Hellman (ECDH) key agreement, HMAC-based key derivation function (HKDF), and SHA2.</t>
              <t>This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9180"/>
          <seriesInfo name="DOI" value="10.17487/RFC9180"/>
        </reference>
        <reference anchor="RFC8032">
          <front>
            <title>Edwards-Curve Digital Signature Algorithm (EdDSA)</title>
            <author fullname="S. Josefsson" initials="S." surname="Josefsson"/>
            <author fullname="I. Liusvaara" initials="I." surname="Liusvaara"/>
            <date month="January" year="2017"/>
            <abstract>
              <t>This document describes elliptic curve signature scheme Edwards-curve Digital Signature Algorithm (EdDSA). The algorithm is instantiated with recommended parameters for the edwards25519 and edwards448 curves. An example implementation and test vectors are provided.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8032"/>
          <seriesInfo name="DOI" value="10.17487/RFC8032"/>
        </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="RFC8037">
          <front>
            <title>CFRG Elliptic Curve Diffie-Hellman (ECDH) and Signatures in JSON Object Signing and Encryption (JOSE)</title>
            <author fullname="I. Liusvaara" initials="I." surname="Liusvaara"/>
            <date month="January" year="2017"/>
            <abstract>
              <t>This document defines how to use the Diffie-Hellman algorithms "X25519" and "X448" as well as the signature algorithms "Ed25519" and "Ed448" from the IRTF CFRG elliptic curves work in JSON Object Signing and Encryption (JOSE).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8037"/>
          <seriesInfo name="DOI" value="10.17487/RFC8037"/>
        </reference>
        <reference anchor="RFC8410">
          <front>
            <title>Algorithm Identifiers for Ed25519, Ed448, X25519, and X448 for Use in the Internet X.509 Public Key Infrastructure</title>
            <author fullname="S. Josefsson" initials="S." surname="Josefsson"/>
            <author fullname="J. Schaad" initials="J." surname="Schaad"/>
            <date month="August" year="2018"/>
            <abstract>
              <t>This document specifies algorithm identifiers and ASN.1 encoding formats for elliptic curve constructs using the curve25519 and curve448 curves. The signature algorithms covered are Ed25519 and Ed448. The key agreement algorithms covered are X25519 and X448. The encoding for public key, private key, and Edwards-curve Digital Signature Algorithm (EdDSA) structures is provided.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8410"/>
          <seriesInfo name="DOI" value="10.17487/RFC8410"/>
        </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="RFC8998">
          <front>
            <title>ShangMi (SM) Cipher Suites for TLS 1.3</title>
            <author fullname="P. Yang" initials="P." surname="Yang"/>
            <date month="March" year="2021"/>
            <abstract>
              <t>This document specifies how to use the ShangMi (SM) cryptographic algorithms with Transport Layer Security (TLS) protocol version 1.3.</t>
              <t>The use of these algorithms with TLS 1.3 is not endorsed by the IETF. The SM algorithms are becoming mandatory in China, so this document provides a description of how to use the SM algorithms with TLS 1.3 and specifies a profile of TLS 1.3 so that implementers can produce interworking implementations.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8998"/>
          <seriesInfo name="DOI" value="10.17487/RFC8998"/>
        </reference>
        <reference anchor="RFC9367">
          <front>
            <title>GOST Cipher Suites for Transport Layer Security (TLS) Protocol Version 1.3</title>
            <author fullname="S. Smyshlyaev" initials="S." role="editor" surname="Smyshlyaev"/>
            <author fullname="E. Alekseev" initials="E." surname="Alekseev"/>
            <author fullname="E. Griboedova" initials="E." surname="Griboedova"/>
            <author fullname="A. Babueva" initials="A." surname="Babueva"/>
            <author fullname="L. Nikiforova" initials="L." surname="Nikiforova"/>
            <date month="February" year="2023"/>
            <abstract>
              <t>The purpose of this document is to make the Russian cryptographic standards available to the Internet community for their implementation in the Transport Layer Security (TLS) Protocol Version 1.3.</t>
              <t>This document defines the cipher suites, signature schemes, and key exchange mechanisms for using Russian cryptographic standards, called GOST algorithms, with TLS Version 1.3. Additionally, this document specifies a profile of TLS 1.3 with GOST algorithms to facilitate interoperable implementations. The IETF has not endorsed the cipher suites, signature schemes, or key exchange mechanisms described in this document.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9367"/>
          <seriesInfo name="DOI" value="10.17487/RFC9367"/>
        </reference>
        <reference anchor="RFC7957">
          <front>
            <title>DISPATCH-Style Working Groups and the SIP Change Process</title>
            <author fullname="B. Campbell" initials="B." role="editor" surname="Campbell"/>
            <author fullname="A. Cooper" initials="A." surname="Cooper"/>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="August" year="2016"/>
            <abstract>
              <t>RFC 5727 defined several processes for the former Real-time Applications and Infrastructure (RAI) area. These processes include the evolution of the Session Initiation Protocol (SIP) and related protocols, as well as the operation of the DISPATCH and SIPCORE working groups. This document updates RFC 5727 to allow flexibility for the area and working group structure, while preserving the SIP change processes. It also generalizes the DISPATCH working group processes so that they can be easily adopted by other working groups.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="67"/>
          <seriesInfo name="RFC" value="7957"/>
          <seriesInfo name="DOI" value="10.17487/RFC7957"/>
        </reference>
        <reference anchor="RFC3710">
          <front>
            <title>An IESG charter</title>
            <author fullname="H. Alvestrand" initials="H." surname="Alvestrand"/>
            <date month="February" year="2004"/>
            <abstract>
              <t>This memo provides a charter for the Internet Engineering Steering Group (IESG), a management function of the Internet Engineering Task Force (IETF). It is meant to document the charter of the IESG as it is presently understood. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3710"/>
          <seriesInfo name="DOI" value="10.17487/RFC3710"/>
        </reference>
        <reference anchor="RFC5434">
          <front>
            <title>Considerations for Having a Successful Birds-of-a-Feather (BOF) Session</title>
            <author fullname="T. Narten" initials="T." surname="Narten"/>
            <date month="February" year="2009"/>
            <abstract>
              <t>This document discusses tactics and strategy for hosting a successful IETF Birds-of-a-Feather (BOF) session, especially one oriented at the formation of an IETF Working Group. It is based on the experiences of having participated in numerous BOFs, both successful and unsuccessful. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5434"/>
          <seriesInfo name="DOI" value="10.17487/RFC5434"/>
        </reference>
        <reference anchor="RFC7748">
          <front>
            <title>Elliptic Curves for Security</title>
            <author fullname="A. Langley" initials="A." surname="Langley"/>
            <author fullname="M. Hamburg" initials="M." surname="Hamburg"/>
            <author fullname="S. Turner" initials="S." surname="Turner"/>
            <date month="January" year="2016"/>
            <abstract>
              <t>This memo specifies two elliptic curves over prime fields that offer a high level of practical security in cryptographic applications, including Transport Layer Security (TLS). These curves are intended to operate at the ~128-bit and ~224-bit security level, respectively, and are generated deterministically based on a list of required properties.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7748"/>
          <seriesInfo name="DOI" value="10.17487/RFC7748"/>
        </reference>
        <reference anchor="I-D.rpc-errata-process">
          <front>
            <title>Current Process for Handling RFC Errata Reports</title>
            <author fullname="Alice Russo" initials="A." surname="Russo">
              <organization>RFC Production Center</organization>
            </author>
            <author fullname="Jean Mahoney" initials="J." surname="Mahoney">
              <organization>RFC Production Center</organization>
            </author>
            <date day="29" month="August" year="2025"/>
            <abstract>
              <t>   This document describes the current web-based process for handling
   the submission, verification, and posting of errata for the RFC
   Series.  The main concepts behind this process are (1) distributing
   the responsibility for verification to the appropriate organization
   or person for each RFC stream, and (2) using a Web portal to automate
   the processing of erratum reports.  This system was launched in
   November 2007.

   This draft documents the existing system as a means to facilitate
   discussion to revamp how errata are reported, reviewed, and
   publicized.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-rpc-errata-process-04"/>
        </reference>
        <reference anchor="HPKE-CHARTER" target="https://datatracker.ietf.org/doc/charter-ietf-hpke/">
          <front>
            <title>Hybrid Public Key Encryption (hpke) Charter</title>
            <author>
              <organization/>
            </author>
            <date year="2025" month="May"/>
          </front>
        </reference>
        <reference anchor="CFRG-PANEL" target="https://wiki.ietf.org/group/cfrg/CryptoPanel">
          <front>
            <title>CFRG Crypto Review Panel</title>
            <author>
              <organization/>
            </author>
            <date year="2024"/>
          </front>
        </reference>
        <reference anchor="CHALKIAS" target="https://eprint.iacr.org/2020/1244">
          <front>
            <title>Taming the many EdDSAs</title>
            <author initials="K." surname="Chalkias" fullname="Konstantinos Chalkias">
              <organization/>
            </author>
            <author initials="F." surname="Garillot" fullname="Francois Garillot">
              <organization/>
            </author>
            <author initials="V." surname="Nikolaenko" fullname="Valeria Nikolaenko">
              <organization/>
            </author>
            <date year="2020"/>
          </front>
        </reference>
      </references>
    </references>
    <?line 829?>

<section anchor="appendix-charter">
      <name>Charter Template</name>
      <t>The following sample template is provided for area
directors chartering
dedicated working groups that deploy CFRG cryptographic
mechanisms.
Text in brackets should be replaced with context-specific content.</t>
      <artwork><![CDATA[
[XYZ] Working Group Charter

Background and Motivation:

[For post-publication charters:]
The IETF Crypto Forum Research Group (CFRG) has published [RFC xxxx],
which specifies [mechanism name], a [brief description].

[For parallel charters:]
The IETF Crypto Forum Research Group (CFRG) has adopted
[draft-irtf-cfrg-xxx], which specifies [mechanism name], a [brief
description].  CFRG expects to publish this mechanism as an RFC
in [timeframe].

[Common text:]
This mechanism has applications in [list key use cases].  Multiple
IETF working groups have expressed interest in integrating
[mechanism name] into their protocols, including [WG1], [WG2], and
[WG3].

To ensure consistent and secure integration across protocols, the
[XYZ] working group will coordinate Standards Track specifications
for [mechanism name] deployment in IETF protocols.

Scope:

The working group will produce the following deliverables:

1. Standards-Track Specification (optional):
   [For post-publication:] Produce a Standards Track version of the
   CFRG mechanism specification suitable for normative reference.
   This document owns any mechanism-level registries (e.g., algorithm
   identifiers used across protocols) and eliminates downref
   requirements for consuming protocols.
   [For parallel:] Protocol profiles are the primary deliverable.
   Mechanism republication is deferred until CFRG publishes and may
   be omitted if profiles can reference the CFRG RFC directly.

2. Protocol Profiles:
   Standards Track RFCs defining integration of [mechanism name] into:
   - [Protocol 1] ([target RFC, e.g., TLS 1.3, JOSE, etc.])
   - [Protocol 2]
   - [Protocol 3]
   Each profile will allocate code points in protocol-specific
   registries, define serialization formats and parameter
   restrictions, and specify protocol-specific security
   considerations.

3. Algorithm Updates and Extensions (optional):
   The WG may add new algorithm parameters using CFRG-approved
   primitives (e.g., post-quantum suites) and resolve errata or
   clarifications identified through implementation experience.
   Substantial changes to cryptographic constructions require CFRG
   review; the WG coordinates with CFRG for such changes.

Out of Scope:

- New cryptographic mechanism research (belongs in CFRG)
- Protocol redesign unrelated to [mechanism name] integration
- [Other specific exclusions]

Working Methods:

The working group will operate on an accelerated timeline with tight
scope control.  The WG will:

- Hold virtual interim meetings as needed for rapid iteration
- Coordinate with [relevant WGs] to avoid duplicate work
- Request CFRG Crypto Review Panel review of all profile documents
- Sunset after delivering chartered items (typically 12-18 months)

Milestones:

[For post-publication:]
- [Month Year]: WG formation, adopt mechanism spec (if needed)
- [Month Year]: Adopt protocol profile documents
- [Month Year]: WG Last Call on mechanism spec (if needed)
- [Month Year]: Submit mechanism spec to IESG (if needed)
- [Month Year]: WG Last Call on protocol profiles
- [Month Year]: Submit protocol profiles to IESG
- [Month Year]: WG closure

[For parallel:]
- [Month Year]: WG formation, adopt protocol profile documents
- [Month Year]: WG Last Call on protocol profiles
- [Month Year]: CFRG mechanism published (external dependency)
- [Month Year]: Adopt mechanism republication (if needed)
- [Month Year]: WG Last Call on mechanism republication (if needed)
- [Month Year]: Submit mechanism republication to IESG (if needed)
- [Month Year]: Submit protocol profiles to IESG
- [Month Year]: WG closure

Success Criteria:

The WG is successful if [mechanism name] can be deployed
interoperably in [list key protocols] with consistent security
properties and well-understood integration guidance.
[Suggested: interoperability demonstrated by e.g. at least two
independent implementations per protocol profile passing published
test vectors.]
]]></artwork>
    </section>
    <section anchor="appendix-checklist">
      <name>Pre-Last-Call Crypto Checklist</name>
      <t>Working groups introducing cryptographic mechanisms should address these
items before WG Last Call.  This checklist complements formal review
processes.</t>
      <ol spacing="normal" type="1"><li>
          <dl>
            <dt>Stable algorithm specification exists:</dt>
            <dd>
              <t>Does a published or imminent RFC specify the cryptographic
mechanism in full detail, including security analysis?  Or does
this draft invent new cryptography?</t>
            </dd>
          </dl>
        </li>
        <li>
          <dl>
            <dt>Crypto Panel review completed:</dt>
            <dd>
              <t>Has the CFRG Crypto Review Panel reviewed this document?  If not,
has a review request been filed with the CFRG chairs?</t>
            </dd>
          </dl>
        </li>
        <li>
          <dl>
            <dt>Security Considerations drafted:</dt>
            <dd>
              <t>Does the Security Considerations section address algorithm-
specific risks (key size, parameter choices, known attacks) in
addition to protocol-level concerns?</t>
            </dd>
          </dl>
        </li>
        <li>
          <dl>
            <dt>IANA code points identified:</dt>
            <dd>
              <t>Have algorithm identifiers, code points, or OIDs been requested in
appropriate registries?  Is the registration policy appropriate
for cryptographic algorithms?</t>
            </dd>
          </dl>
        </li>
        <li>
          <dl>
            <dt>No duplicate work elsewhere:</dt>
            <dd>
              <t>Have you confirmed that another WG or SDO is not standardizing the
same algorithm integration?  Check related WG charters and recent
IETF Last Calls.</t>
            </dd>
          </dl>
        </li>
        <li>
          <dl>
            <dt>Backward compatibility considered:</dt>
            <dd>
              <t>If extending an existing protocol, how do implementations negotiate
the new algorithm?  What happens when one peer does not support
it?</t>
            </dd>
          </dl>
        </li>
        <li>
          <dl>
            <dt>Performance impact assessed:</dt>
            <dd>
              <t>What is the computational cost compared to existing alternatives?
Are there environments (IoT, constrained devices) where performance
is prohibitive?</t>
            </dd>
          </dl>
        </li>
        <li>
          <dl>
            <dt>Recommended vs optional status decided:</dt>
            <dd>
              <t>Should this algorithm be marked "Recommended" in IANA registries,
or is it a special-purpose or regional algorithm?  What is the
justification?</t>
            </dd>
          </dl>
        </li>
        <li>
          <dl>
            <dt>Test vectors included or referenced:</dt>
            <dd>
              <t>Are there test vectors for implementation validation?  If in a
separate mechanism spec, is that document normatively referenced?</t>
            </dd>
          </dl>
        </li>
        <li>
          <dl>
            <dt>Algorithm agility preserved:</dt>
            <dd>
              <t>Does the design follow algorithm agility principles
<xref target="RFC7696"/>?  Can the algorithm be replaced or deprecated
without redesigning the protocol?</t>
            </dd>
          </dl>
        </li>
      </ol>
    </section>
    <section anchor="appendix-summary">
      <name>Summary for ADs and Chairs</name>
      <t>Three elements for IETF cryptographic standardization:</t>
      <section anchor="two-lane-model-mechanism-profiles">
        <name>Two-Lane Model (Mechanism + Profiles)</name>
        <t>Separate cryptographic mechanism specifications (CFRG Informational
RFCs with full algorithm details and security analysis)
from protocol profile specifications (Standards Track RFCs defining
integration into specific protocols).  Profiles normatively reference
mechanism specs rather than duplicating algorithm text.  This avoids
duplication, ensures consistent security analysis, and lets one
mechanism serve multiple protocols.</t>
      </section>
      <section anchor="coordination-path">
        <name>Coordination Path</name>
        <t>A coordination model for moving CFRG mechanisms to the
Standards Track, applicable to any Lane 2 vehicle: existing
WG adoption, individual submission, or a dedicated working
group.  The model establishes a single coordination point
between CFRG (upstream) and consuming protocols
(downstream).  Two timing models apply: post-publication
(mechanism RFC exists) and parallel (work begins while
CFRG is still developing the mechanism, with the AD
assessing stability).  When three or more protocol domains
need profiles, a dedicated WG provides cross-area
coordination.  Scope prohibits new cryptographic modes or
algorithm modifications, though profile work may update
recommended code points in alignment with CFRG work or
Crypto Panel review.</t>
      </section>
      <section anchor="cfrg-crypto-review-panel-1">
        <name>CFRG Crypto Review Panel</name>
        <t>An optional resource to help working groups strengthen their
Security Considerations text.  To request review, an AD, WG
chair, or author contacts the panel.  This applies
cryptographic expertise consistently, catches algorithm usage
errors, and identifies when work should route to CFRG.</t>
      </section>
    </section>
    <section anchor="appendix-eddsa">
      <name>Example: EdDSA</name>
      <t>The Edwards-curve Digital Signature Algorithm (EdDSA)
predates this document.  It did not follow the two-lane
model deliberately, but its history illustrates both the
accidental benefits of separation and the costs of
insufficient CFRG vetting.</t>
      <section anchor="what-happened">
        <name>What Happened</name>
        <t>CFRG published <xref target="RFC8032"/> (EdDSA) as an Informational
RFC in January 2017.  Three Standards Track profiles
followed independently: <xref target="RFC8446"/> (TLS 1.3 code
points), <xref target="RFC8037"/> (JOSE identifier), and <xref target="RFC8410"/>
(PKIX OIDs).  <xref target="RFC8032"/> served as a Lane 1 mechanism
specification; the three Standards Track RFCs served as
Lane 2 profiles, each normatively referencing <xref target="RFC8032"/>
without duplicating algorithm text.</t>
      </section>
      <section anchor="what-went-wrong">
        <name>What Went Wrong</name>
        <t><xref target="RFC8032"/>'s publication revealed gaps that additional
structured review might have caught.  These gaps
illustrate why this document recommends more rigorous
review for mechanism specifications.  Consequences:</t>
        <dl>
          <dt>Cofactor ambiguity:</dt>
          <dd>
            <t><xref target="RFC8032"/> underspecifies validation of public key and
signature components, causing implementation divergence
in whether small-order elements are accepted.
<xref target="CHALKIAS"/> documents this incompatibility across
deployed implementations.</t>
          </dd>
          <dt>Errata backlog:</dt>
          <dd>
            <t>Contributors filed multiple errata against <xref target="RFC8032"/>.
Several are held for a document update that has no
publication path: CFRG cannot publish Standards Track
revisions and no IETF WG owns the document.</t>
          </dd>
          <dt>Missing security theorem:</dt>
          <dd>
            <t>The document provides security discussion but no
precise theorem statement or citation to the relevant
Schnorr-family reduction.  A mechanism specification
under the two-lane model should cite or reproduce the
formal security argument.</t>
          </dd>
          <dt>No coordinated profile timing:</dt>
          <dd>
            <t>The JOSE profile (<xref target="RFC8037"/>) appeared simultaneously
with <xref target="RFC8032"/> in January 2017, but the PKIX profile
(<xref target="RFC8410"/>) took until August 2018.  The Curve25519
key agreement function <xref target="RFC7748"/> predated <xref target="RFC8032"/>
by a year, causing sequencing confusion about which
curves were ready for which protocols.</t>
          </dd>
        </dl>
      </section>
      <section anchor="how-the-two-lane-model-applies">
        <name>How the Two-Lane Model Applies</name>
        <t>Under the two-lane model, CFRG would resolve the cofactor
ambiguity and produce formal security arguments before
publication.  A dedicated WG would then republish the
vetted mechanism on the Standards Track, coordinate
profile documents, and sequence work so consuming WGs can
plan their milestones.  The Crypto Review Panel would
review profiles for correct algorithm usage: cofactor
handling, context strings, cross-protocol attack
prevention.</t>
      </section>
      <section anchor="eddsa-as-pilot">
        <name>EdDSA as Pilot</name>
        <t>The two-lane model also applies retroactively.  EdDSA is
a candidate for testing whether this coordination model
is repeatable: it meets both decision criteria (de facto
standard referenced by multiple Standards Track
protocols; verified errata with security and
functionality impact), it is well-understood, and it is
not on the post-quantum transition hot path.  A charter
for EdDSA would illustrate the model without interfering
with higher-priority work.</t>
        <t>EdDSA remains widely deployed and its errata affect
current implementations regardless of post-quantum
timelines.  Six confirmed errata, some highlighting
deployment and interoperability hazards, warrant
resolution independent of the post-quantum transition.</t>
        <t>A charter might be scoped as follows:</t>
        <dl>
          <dt>Charter scope:</dt>
          <dd>
            <t>Produce a Standards Track EdDSA specification that
resolves the cofactor ambiguity by specifying explicit
validation criteria for public keys and signature
components.  Incorporate held errata.  Add a formal
security theorem statement or normative citation to the
Schnorr-family reduction.  The resulting document
supersedes <xref target="RFC8032"/> as the normative algorithm
reference.</t>
          </dd>
          <dt>Profile updates:</dt>
          <dd>
            <t>Coordinate with TLS, JOSE, and PKIX working groups to
update their normative references from <xref target="RFC8032"/> to
the new Standards Track document.  Existing code points
and wire formats remain unchanged; only the reference
target changes.</t>
          </dd>
          <dt>Crypto Panel review:</dt>
          <dd>
            <t>The Crypto Review Panel reviews the new specification's
resolution of the cofactor ambiguity, confirms the
security argument is complete, and verifies that
validation criteria produce consistent behavior across
implementations.</t>
          </dd>
        </dl>
        <t>Success or failure of this pilot informs how the model
applies to higher-stakes mechanisms during the
post-quantum transition.</t>
      </section>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA61963bcRpLm/3yKXPqHyXEVLcqSZdGz42WLkq2xbiPKo+7V
0ZmDKoBFtFBANYAiXa1WP8s8yz7ZxhcReQNQtNw9+iOyWEhkRkbG9YvI+Xxu
+rKvilN78OammT/L6sK+2i6qcpn1ZVPb501eVPayae2jdrfpm1Wbba7KpX1e
LK+yuuzW3YHJFou2uKYR5CvWDXRgaJBi1bS7U7tYbkzeLOtsTa/K2+yyn3fb
qiqvs3q+5Mfmm/Da+Z07pty0p7Zvt11/986dh3fumqwtslP7Y1EXbVaZm6b9
sGqb7Ybee2A+FDv6ID+1T+u+aOuin5/jHcZ0fVbn/5VVTU3v3RWd6dZZ2//X
X7ZNX3Sntm7Mpjy17/pmObNd0/ZtcdnRT7s1fnhvrot6W5waa1dlf7VdnNrL
rOoKY7Jtf9W09Ic5/c3asqaxXhzbC10SfyhrfVEuP6SfN+2KKPdXXuhpTNad
fdTURJW+rFf22bNH/O1inZUVTbRcXjVV1h07qn1VFv3l/1nhr8fLZm1M3bRr
GvOap/v6yaMH3z78Vn/87uSu+/Gbh98+ODWmrC8HX3948t0d9/U739x1P967
92349IH/9MR/9/79e+7Hhw+/c4N986377oOH992P3zzwj92/94177MGDe/zY
0/n5cbtZzou2zfpsvmmbZdF1NFdrf3r18+P5o5/OXr95/PqUqdJn7aroT+1V
32+606+/zumRvs2WH4r2GIQ5JiJ/Tfz2NXFpSxwxx4fzq82H4mt5Xnn+p92i
LXPlePtzsbOPa2ZH8P4hvn9kH8kQB/wgvYieu3vn7v35nfv0yaMnr3+cvzp7
8fjZ9MRuyg9lmBEz7NfLS/pR9v0VHZMqmREGVKawr4vrsrix/KXB6+/h3T+d
Pfv56dnF9JuLTVvW/XGZLVt+Nz105+uTu/fuJa97k63Bbf1VYddZTcvPzy/O
OnmZZ3L+N9f/ldt/PgZhqg9l1vk/CMf/TExMp464uOmG3xkM8uTY/pi1ZVU1
/WCQJ21WL5uyG/59MMB/HtMB+0AHo6g/NIMh/jOrirbMhl/wJLxjzHw+t9mi
A+eQrHhzRe8jptmui7q3edEt23JRdDazbbEpiMMWVWEjKWXXTjiaZSIcIZto
fkzVp4/f0Crt0952xSYj1qYBk2+btROlttsUy/JSR+/orX/Zli22Jy+KDT2/
3LZlvzN/Jpnov2Yv22Zt6bSQCGuqedOWNPkiH4xl8uKyrDFUCQHZbEiGLsqK
RpvZm7ItrIgDEn0kLunFq5KIUhbdsXmaUiIvcoxJL8AiMSDzdEyKhgRxWWcs
xS4gfrM27+wbnE56fFM1O6Zvc8mHx/rld0beTdKMvkCPbLsC3wIV950KS79f
FdXGJLPpLM2+qFf0JG9C2doLJR6L2DKn5Qtd+uLX/lgYYV3meUWy/QsokbbJ
t0t8BWyh78f0sJ32KrsuaCnXRUWEzG1xeVksIUot7UCVLRoZ3G6yHsqoM1Cf
zDfdFeaYMktYP1iGx3e72RHjPH92gRcbyMCZfdWS7F/uaPFdx/P5z5evXj+h
z189l1/Pz57YrMJO0KG5oQ3rynVZZS0pwpYWtG2J95mgQssnTbtdE0W7ImuX
V/ZH3stDrPbIzZi23U/RDDi0UR5/TZMGybO1zToinyqXps4qiHhlK6xtuFH6
khGjOBIwv66UoP1V1htSzAVtLikH+r0hFgkEPB6eYRLc5XJb8aHLrCdBLuw6
s6IG6ffFTgYzyQ7SvLF1JBizlZOSi2aLie7souhvCuKvlImNsoW83jHM/mMg
osGfMNNftUVhi6rAH0nAZbYna6qCWTaWPId7NsZeE+dMUfBoFh/hdC9sX6w3
IBWv+bZTbG49xZYUTkPcuYYhs4HEdNw84wP+O061kzHmd55qq6f6ac2aeuYF
sVVzgHYcH+FM2bdKBOH9jx9jY+PTJ0NTIemvXPrxo1pKnz453h9uLZbIwrYw
m6br53/ZkiqkM0YzKmiONDva8pRLV2LSln9llnbT+tFkGyJdRseSdrAZaCER
LTa7JvuPP8GmXW7B3cMDQYd7j2ASRXVTkLy4AVFFaBBjEHMRN0JZVTua7lsy
fpst2NR9HPEHjadHwYBN6cwQx0KMb1vWXbQGmh/4oi27gmb0xRf2l5r2av7v
osdoM1Lf4pxYmSllzCvHxEP53qyLvlwTwfLthk8FMVVLb1XSpyI2q8gJoTWQ
niQNTE8WLU2TZEhDS1jRj6y2apEPzEA3umI27yocadrYrNp1pd++K9oe2lHD
lMtovywp1WVBaqATxiZWzVaFCALa2KaxHUQyvYtGnjeX825J6mNmqyLLWbo0
A81AUqFc1fSfkoP4wIwkiTJRmLIzE0D4Bs4MCb+eHJll37S8VBqGDjBpWMys
5WNHazrDCiBglXtpv8ySNoiMC3Ku6ENoHt7tmFIYrm5AnrohkWyElfkv3fKK
Fk9kIlGQ5QWR6NbVGX73TUbWP1bDFCShuCUBRDYKWSS06IocAsiOq+bGHMBq
K1dXPTE+PZUf8NFJ5oYNytpOWO4ZscicqLcqgtS42LYbMOXnMVpJ+3VdtJam
ybLkWUZ0fQRlS0R4+vjiRyWmUDEL57suilxXJN+YCdPcJr0scZgun+RCziYA
6fzteiPfocNMew1tQe9ibUB7i41iZcVcx2wdsT5bfX3JS6F1ECGcCks3pvgV
3xNrzCsRYmZiCjo3jv2JuBXGUmnPFIGHTlK+bnoLG1Xko1vkGbvv8DFStbPt
IOH32kTrbMcndQu71a4y2hM37ZImGSbIs6bNZAnMvJAMGS2/7I0cABgwzPp+
q3jraKJLmD1+ly122bgDJuO6zcb8xFD3RpXoMPm7YY2qvoD6tKSEcz7x66bu
ryAaEt2OrSamXuIb3XYhvhQbnHxgQJkVzW4LGWrBmzQujUqSnzj9bcK+M94S
2u/WHX9HnKdBBpiL7WJddiJiHudlz4K0z2jSl1vibjA+/c6nnfk/b5gJj9ky
9mEHqzGYTlY75UoZb9wXYC1yusqlaC6x5GRkNrToceZq0WDM2TL4wfNfLt4c
zOR/++Il//z68X/88vT143P8fEFe8TP/g9FvXPz08pdn5+Gn8OSjl8+fP35x
Lg/Tpzb5yBw8P/vTgdDt4OWrN09fvjh7djBeItEZ+7goxMGiHYGPlMHxkrXn
eOYPj179v/8+uUd2xP8iQ+LuyclDMiTkl+9OHtyjXyAY5G1NXe30V9qwnRFp
hlEgcpbZpuwzHHqSrx0JxJosJuaAf3kHyrw/tf+6WG5O7v2bfoAFJx86miUf
Ms3Gn4weFiJOfDTxGk/N5PMBpdP5nv0p+d3RPfrwX3+oSB7Z+cl3P/ybYQH/
pmjXZd1UzWpnjA9P2mxFBjW26NScWrBSV7DVGhQnqcfM+2Yqu1MP3QaBxHJ5
W/be5mIhQTYtyZEniJLCYJDACdlR0YNQxOAYiE67x+W3h15c06PisuPzWVDq
zgrRk0xzt6raj+gR57LlE56ZThB2aEuDEHPpu/fOEwO4rw8muqm2MBCs6mk3
u2WqyPzpuCbrNs/0aBcJPT0NvSSnQaABoWkuCnz540fnAyUxYpYPdGREfhQq
rDzR6EHaZg5onxxHCp7ec1lWBdjhbOyYuRnTTnRkjxGdiJgHkQuFjdEvHRyl
BlMaSCHjkiRzQ4/KZmF7XJTGEZMYBwYJVpDZFQnROlDmf275d2EB2VvC+x+/
uOUNIoBv8UL3xLVcFIykIj1sODrrrQd9huNX7HR0qiDLeslOI82dVMWGKAGN
6E9FOLWxKiGZyJ4ZQt5EkUMSs+T4nRyd2kXWBQd0GL3wkQS/hMhT8G+aQd42
N+Ddgv5StHAJi+umui5iS5ocJbUzwXCnIUFiz5wEMkb+GCQOO3xjgTMtbsz4
qIjcoZ2FSwdL4orU/urKuvf8Wnb9TI0dLIBoeQM1IfFe/xJa8gq+XCG28hci
xc5UitmLmGxkYly5qIfGOhKJNiPzKgodZfuCR3tiR1k9Dh8p05jInpADN7by
/P7NEleATWFirnUJS0ViLsRp1TbHFMOe+9PD3hRzYEWK3NBsyJmhKZFAUGtm
MxDMrU64kEfF+cJr43hVMxTkhfpnToiLKKiqSDZzrFajUZD5JeYEMggZV1uS
rOBhdk6wyR9qWANkHlzSQNjRs736Jm9oVjDXlRiBs2JZhlVEzvJYigVRR1sI
I1WO6OGbZxfmgn7NEJa4EH+QVMEWq/73lxePI9IjZA+fvF8eH83IY1o1fSn8
Fmsmdl5DPJAp7Wfh534JHx/Sx4kb44N25LDTVLoB/6dEWRIPdkVLx9uFsLyX
EbxsWPcdc4BY1HSIgwJTCz1vmLbqHQxcnLaY+4iCMY9/zbCtpyLHkIAjOebY
nHMyfDhs56jp3Gu2yPsbOufEKo/zG9ZlxGLXRTdgcyw5Oh63WBQuWKCxSccj
Mh3ZONqIVz8//WOIoajgeBysiwvHwVGumDRNsD/mnsfnYY8/qXzJBjLQD+ZE
HG2St03oiNTOuWI3zUXbrp2+EjHhlmoPi+PV8cy+eEp2cRylMzjx5OrwcSM+
FCnnCAA/3rLnJ9PZpTQVf2ifwdQ216Xbhi1x+6JcbRsyooLM+d7w69RWKrok
kuN819jkJE7teJtFy3M4l/1RJoXoReg1smEqOSvxC9je7MjCIPuiRBJQ9H33
6dMRnC7SKdEXRb2IPrGJPiHXgzOHptSsnypXOETioiZG4akxn2UywjxjRvBh
5MH4ZCDEPNLvNgXeSWYPnd9cKRhTS3cT9GE/k3eibzbEHM0lPcZnOB3wS8lB
qfeOc1x0nFsretiyx8ayR0H8oEl7r6G6fpuXutvqcHg1bgdLmckR/CsGGId4
yPOFvRxFdcCjTRepqQZWifXqDYEgqAB6rMJHsfLw8c+gN5xEc4FURGPsLbY/
jvpEoMNvGIRUvRpuGA7xBDvM4EJMRE2sPfz4EXlyBw6Rz+cbfIk41GUQklDS
l53Y2DDvw1awBXVJsy8l3XImlnLCheCaPa5L2cVCPJesAqKCcvqUq1xMxM1r
D3sb4bdkSsykcoLFZEY4SA7w97G1bXQmGcI9PB3igcKffs3WdyEyr5YIHC42
V0EnFWi6tiZEk4bepMrzYMW+9jnh2LseWNQhBkACt8AUnp69OIvzyWytOlwQ
TggRLPzZSRieeF5esuVE87ypi5b8c00zAxTip6DR+TAGO3berihhm0NztGpq
rxGYXEikGFoTNouEMDmsAgDOWo5AnIX1+hm5GRILPz9+PrM/nz+RU3X2+Oyc
z3cRv0/FQ1eoLMyuGzpyiBvcaAYr1nF9V1SXTuXj7e6kcvg3yU5E3mywwVIC
PArOJxMTUSMMKenQ1q+NlsKW1yZbFtEyMfNnF/b32W6Pkk8h5iJaOFIsyGFg
FEIwl4YnloaqGe+xDxhxrDbCei8POD6K8Qpvf3RpHt7g5P1BNWN2c6L6mkQu
TM0aMtJA/e1J+Kmb/vFjSSJ6nh73+aYiumJN6qd7oUvHWWe7i7gbvCTwJ+iU
ptpKmNW7lXdPrQ9jvBKqkS2jGWZ4UEfqYt7FovItfI79CSM5DtmHIlGk246V
1BQUAbpuedUgZhvi55azWDx1TgT1Ozqdf//7322WddcrD8kh6ksaZK+r67+a
/vvbns+v/edfzW/795X/3t/ErRVNAgyAX3P6nr+FrOoPt83nc9/rRv2tlb14
OfzGnx5f/O5RrkffAKX2zfWrW/5k8LrzRs0LzYexDYxp/I2ELLFcvnPnIprP
30QHZpyaUKvkB6uPDRjyh/DYPzjJEWEGREp/9fSKyE10jr+SbkS0Cb//JfFu
DHYm/RWbxBJKf39CrjedFf13QRZalSOysgCh37ZQNSo3OzYo85Jk2JZstUji
4R99ad304rfQPxeMEA2Xt5yt5n/08vjfRZ9sUPgVARlVT/Ar6EcBEZDMd+Hg
W/7tO836j7f5q6njMxznM0cMO/vi5f/MiNG+Xe/94nm0B2dAcVxzkH36X0z5
nJQB7ZHdv3wPRqGNcxxgr8ts7wNfha+JWoTyE2W475FDMkMycmmObMxat5NF
/3U+lwglYD6eMtD0fx+oWnLZfkvqqjiwX1yWq7n7bI7PyP8/SMT0gUR3x1/8
FEIbCxJRUZxINBuzoppVqg1z0bBTGRBvt8RPA7vg3PF82vV+gtjYxIDBEHIu
wtivN1N+/SgNEoWcNOyAw5tGHtgGISr9VnDlkw/TBD44c64LYjPy8fxmNXce
jQ/I1IF70gR+6WP3a4TYxMIijZF66AwnYEN7zjnpBECEbG9Z0/PVTMj/NnbU
sb3sxgSNracgZMyx0yOTUm2Wtz86372b8lwZeMNxtEEsGSRE9HPbw6bjNyyb
lrwpBzXwWAhY9p24POzFk5q8wWtvrmDYfiiKjSObWuMmpAByv+8IX+kGPQ0C
PWTnaYfCaZyHk+a2qG72bREvz22T0ihvYOHCgTGR+gijBhMy8ya6Y0UEhmWh
CUIvyUXwVNJYEUdcGKauEX8yFf/Fnp0TsxLTINdw6gIq+KCErwTPSv6KiQyR
iMHfd3HBCIij2y+OsWeBGHWICoQYdxgisv9in148ltlEUAk7AZUIs0PEJU1e
uMm5XEc0kk/KMgeBZNDjjKshqdCWDogJN4HH4lfRmaat32zbTdMlFoBGNN23
KwYCidwKjhq7qJ3LWkp0WvdD0rJD3wbBjmjK0eIVs0jvWWY1xon8fRMcse+D
8tlLg5CHM559vXNEX2OHrs3YCqWZ1+Gc4ZQ1NbJWb6KUdQVUGO30/KbAT0xb
JmWdtW1zI7A7Zlw9bEFbJ1hQRKu9MUUi0cemx8hWH0IAAErjxLF7T6fM7EPO
h3jNyFkzUbIjlmXBAhjk8ZjEQ4wgYM4ktzaM/kQWUzzMcS5JBFuJnZC4Rjw1
+st8v8su6D0kSpeCDg3hh8jVn4pWcH4q8dKxjbsNUm0AwAggEFSToAng0cBk
QxAPZJlS3nOcnok3zy5mBiELCVHMOHNxJKBg4YWyE1g33sJ5v6rIWtMTXWvO
+EGlIXOkQdR9WkzrMug8xnEHLiGTkA1JCva8NUbPZ1gRySF3689AXnbEusvY
sjGHkud+eP/Bp0+cw3FfOuLI5h+aJ5JBQn0VLKQ0eGnLS5Knrs6iKq6JsqA4
DV9CgCFR7cOqErGFFdKy9iDBww96kgE3PJeAVX5spwR3jvjVmgNabK9Eog2H
Euh2zFjw5mDFXy3/GL9SQbJunZ5M0do5LygYN0dO46QywipCNFSfaW7jypPd
MjQqAAGYJxyT7stcLwqNH4HN1KasYfJgYbGONY4vSxcmUZY8QHQtPiQYA2wZ
8qxMlT8eHEkSjqdJJkOPqDzi9OQK1mQJr5qsIq7QURm4A7OjrCrdeAUNjjLl
gakOjkQUaAY405nSSeYqjKtyUYrY+HWTMYBd8lwAHjIES2O+5JhmqxWAiKgp
tCd35yffKcBRSU4TY94OgMfuaiY6qPEz9WEm2UY+KeAhp6gQC9WQNbAdDHTa
K8VOJYx2HaQeNOS64Q+29RbPXxYc4URxAikOLpFiGcBGmehy1Uh8hljahQXp
4jlWmHGQNYT1LkM0mb7Ke2ykbMGJz3hMEEGy0x52IGZbtiqOE5bVd0Ybtq2R
Y1pWGa1IyntwqKsGyObthiHbPCLXfwHx5rg1Z0g/XkInVm3PL9Jgtyx1XCkx
i2opSqmzGBVPzAzn0TvGvwOiRFKm17zQUqtAxPiB2yKcfpN1JozsDE4WFJoX
iCxCOt0zG1domN9VoZHmfod2UtC4RNbOw8sb5w+68oxT41Nee+FkrB7Lzrsy
kWwZuzKSbFQ2ijApIiddgmIcmRX2cPKh2mnWIIOAllM9o8MBrhGGVtmgKSve
4mFCglhCPEsudsjLX+f6Gg1oZ4jywRRyb3dFRGpaveHMssDMYE+lmWZjXie4
fnKXllc+n+WrXzgLm0tdiQygeSCxF3kibB14NwXqa0EUrJEqeoVNjmjsgKBh
rcQyTjQtChqtSEcidm17jyWx3t2LdX9bdsJZqObgw9yzGQo0jwJi6MmkZsxX
h61hrfQN186EXHJZi5EDFwfGhEBOndjlJJDG4LCgV+Olq/cpcRAUT5UMEGTI
1gQS07kiS7K4YHGPlncK8yHlXeuE8SylGMQ222IOJgPr5Lzz2VBNsHlsAlNZ
YpxZ14EbotxPr5WqAcIg74XJErYL+VLk5G3IjKhn4oq3tjVRYIQ/jfb+MGDZ
vUVAduICmH9yO7gsAC5eVOpBk25x0rJL2mrlebcV5+7wP0IkB0byJLt7Pvf+
dsmZq6Gx7Z2Bkdmv5WFjIJSGkNjLfhsAXZFMoUUvdqRpqmyHMMfMnl28OD7B
8dpWnOm7ePmCluwrJ7sjeMbI6e7BfAkaNUJDfdlFxj49/CJAu/gERFKXLFIp
3IkMXnpgvCl8vPYjuOihcX50X0aevI+RW9OSQrX35yf3iUVXDkjlmaPa2aQG
tdhXwc3ruyQu6MT9HZZeu8xsUsciJmOAhHUBE/YgwoRxCjY1Fhkmdmz16/dg
7Rr39QFYy5I6pbMUCBrDznhX2kiZGRcMYOOghlZ6hAwEius/fgEPfTdf6gef
BDrUlf3WVTO15WrFrns5ECrwAVI0Eeqi1M+PdzfTTJOc02Oco1hnItAYRSfT
elTBeQdgfPpXgeN7xBDTMazbhmLkdSN4myuuO8Jjnni5QPPoOFxmS44pdTqC
XTB2x4ULJkuBoxgC0Z0jzkRHReWrqy44R8fAXOhZLyXEhA/I/qUXo04Ts+Ng
OONZcj3iV01F2nP44tTugD/nXG0AF3goLkEJhhvG6cRvPtc8xWtnpkDiC6al
GD9OU2+wOHk+kz2YL5iIoh/4+QVLZsjzyFOk3X6BMqso9Ou6IgxXFEVLPBrJ
x/E5lIy9ijFejMYB3T3SM4J9SJk/mVNwatjKDchThgb0M9UmI662oeqH4dYd
Yo8sLqK8WYT5GavHSeUI2+Mz1GOqHGVJTj3KIb6AMUimHXt6US4/OXZfdoGJ
ANsjyyYSzdCWdgEvMfWucE5xikKN+JEzuBIyFZf0rX4/TiGKbXI11KZ3gc39
8S+8F07ylp9ydtcxgrwxrxeAxUlUy+XbYk8MdtrWA78kjNoQi5eXIbQk9kAU
NRiFfmFXSEyCKwMCZIq3KVuSbcCNCQC7cnGmvFj09nBbi9daODAIuaYMFy2R
KZoNAeBazAlbxRFaaftbgcKJaDpP7rL8tZBzHiUBthvxehwJ1OtQc2yqiD8k
vNgg4FG5VBE+IU7NnvpMGvlR4jiHMKSxEdVlRgl6+qxWsPQUqy3ZvlTamkjj
MaOz7CZrXSm9i6OmBboRRLshhbGgyzglMTABeOkTTltYhwYTJOriKvVc0AMR
7gFepkHGs2mNLw0lxglGFP05AkrZ1C8gIUtWpJSuMPXEDwyFNIO4rT9Ckt5v
6lXDerr1IQrVpxido3Aig8Y5tuNR/ZVEQV0QY1Tq7u02Uqix4D0MCFbaSbIt
lopu7WB9VNpWS2FKqEWOzE34wjQSsdiRx6P50LRAyGQeJswDhpCL3n3vQ09q
fzKgtdrdUr/Mz5MYERDXo5gr/6C+INRANyiyksIqFUpsoSQahq3u2Jc0h9uN
JlOiQw5c2ZGPKATWi3iyGNivhxCIOpIjO2oLtXhwb/OQmYs60dbyG6Dbm8pV
RUa4A+MSyyHTC4C9e0FtJ5ORMwkgSyaPo9ASAcKYZ+cx5jWSub84miTU82py
Ui0JbTWTpFEduFEkHVi9iAxgOeQAerMgNBCDa/35k2xBBK1zAss60HDOpkUX
qQDOUQrAHTIuSnvJOzdN7ZpFvLBjMGM3Kkk7Dxs6JoPL1XcaQogZhP33WCA0
bTi74tIVWrhNUxNwnwMcT9B0pu5uMIXAQKeJL56apGx0BjUkL45KGgRfCwMe
YqoLoRGLyk23MlbVmwqmiw+zwDpokfAZGTyjWKEgAcXAks2QUoE6dAWK22k4
e4INWFKADJaPaZF0exLZJ+kkhCI1YEIy3yWrZyZKNunfUI+/lTSsVoTV1xKi
V7uPlIPIsULw1WkYGsF3BgKXGzGvE8kTFWZyBWyboT+GK9ZPGJTrE8xEzKSb
2TG4dTZGtoomFZmqWZ9KzQopCnUdEArtyqIHBrvmOsmE6MBrbxi8RuxiXPHb
Tbvw+2HG4saY22rFymG3K/jhnH9gA62yh6hvNHIAj7S0WlLl7DMSeVCyFc3m
UFnoCF6lZtfQ+EVyWA+/ffDpk9JIYoeaecBoI6eMM1MBaGI4csXOQK5VcHTO
aV05V2t4saszAL2JDaUJEOIk8E3m0uzMBY0HGos9OrKLXLOserteCBJIx0T8
udjE5B1WegWjNd9jps7Y9GEx0o9iN11qlo8ONKcVEWiApCIPZuAA5C4K6ost
gJGUiHPvGuBoxbXRJmILzk+si6zbch5FivQqjfn3QpFhQBWZnStylrTUKhyK
GD0j8BjFD7qpKigFWylSRq17L3oQvsnRhqNXO4Uk1pA1omXGWdmpwoSOXcyq
mLF7kMvZEWye6xboAyEL8v1IQu3FnANXc2scArGaGAwghUCDENOnI2N/t3Mz
825fiH07krmiW7Sscn3btJeW1yPTFANNJmnmKTUdJPIhIpFiHFEddAF65WoH
APu6tbZAfHp/6l86kQu4Cmx/LrEOuP+lg9CMqnNmPlmAAgzO77tKM8U/hvII
n9qK6iSOxbD5spNKERpo2IhL8VWn4y5Vwa4PZYezpCtXQHUFAZcDNsh2vUpj
sbVvK49JS1AmKk/2tjuM3xyKNgbhkySZp6H94yHEBa5PlEtk5otmGPr6+d5j
eYgQRzbZEXtpv5V91P5m3kT23Q5G69fuAEh0TBiXJigbZJFRZe71vEJ/YsG+
vzxH83ZlndajdRMFOxPT8AU7opkD+9nby3SinN8SdhFaUtQdnc82QZyFneXO
qmhIEJ8fy7mWQWw8KvyULJYUmJEFu3aYIhy170OilUTbMFseCpE4ms0hDV9d
lALRJPnqcq6uqshF6AO+63lUw2TGbTmjMJSzztZZ+wEdT35qKjnxPov1C3sv
BzSX6U7NbJdI+BEWtybdkigvgACDaYCaiVUn+zSKBmbSU8HRx2QVI53Z8pOI
Wi6RShpzUdRkN6F7JgO5onpHb4yO8bcJH3kTSTSc1xySbHC2TALfuJzkVQcV
EfMoLCAA4X2zgpDG5uPHKyYBGofCAfGKoteKKfhNHWNILf+jSQjn8H5WCmIi
mzJqWOhzKQG0PtDu/Bh/aN2HRMUY2HGIgyORDQnj3b8PtNvhs+cXRxxxScUK
U8qIyssnKlL5QLLuuFFsV1v0EI19D0SyO7OGBNLozMYWq8Br9lqtfcbxEkaa
7yn+EwYRZLXw7hUqjYW3cnQU5Xyrl7XY8KTLqCBXmAZ0IAo1Lx6Ji/VIXCz7
B+mGwaW8/6AJLlBesBLCC6afroJnU7Te2che96LACQvpNDc0FNTVlYAPMdhp
0glvEIYLNaeI/080TfD9+fb1m3V2iVE8gSDygyb3LVtLTVex8dVNGkHmcOzo
2kQKHrnEbwz8V7QGQ8DGAcXQ3RDCHiGOMTmO93ex5IYwwyw3isK3YnQHk8JE
yfykNXhAekjIIYRkfVjr0Z4p00R3XYi7SVR6YJ/lYIOqw30NmsmSRLjrRskt
rPbtX9SjO/aHp3b648fQsZ+Or4MqiD0h7xqWgbimIZzV8jJFEd9wJKT3JdA8
r7nXOybDjQq+RKIOHrCcSKmQKaudrxgaYDJ1rcQKjV20w9gST0SCMMtso0Gp
Y7Xx/diMlYIjljTeHDCEhFN5jiyzfRdhqGM6sFy6AnRyWK9Gq/Y26oSia1zc
yvU5hSVzdj7zGGPOEWgUV6Oq4r1xEFvCVzNevrAhF62HLAIJTg/6FJdXZvfl
UHwsBXHjAiUXj6WaiANayQxZ15TTNQ7gU375ZVkLykJLJhalRA6NWKgp6Fmm
D/VORwrNUVILR2BW6IS5ByltHQRiqi1GKRB3bLATVD4MgNopT52UrxRczexi
nkrkRuiaF2vBCHL7ttASQfw3adhBO4+yhiKXLipYODJG2xrMxe1Zf91UmMzl
tuWZxxeccBR/s0H+7bDbAu7UmaBd9HRA/bWIf2L33aaGYGhsjiG2Ge76SHqb
c3utbcc4XH0S52QpyyY1+BaH/WmnAqHIRWwIISKYzpCVWiQU6kIb7kf2GD6T
brdaDRMVVzkwswofKQzRM3RqzHzQ8npwpQPHI1xKT3NZ9MytDYN9/y//ZOT9
lt0HDPAoWgxQM/4d0ofwkJOLs6RLtitDPKLHX3kfXedkD9GYtUPn8pl0gJZw
Ik0DfeBcK2ju3ssjPIp61zSXUc8ae/jzObdnLxHV5oYaPCdtCUaPPr69ytIV
VKR1mqdR60nX4ycgwaqsXAs8ZnT1gl93zCShFZZvOp5K2XNttIu/uMRn2pHX
9wuGDPKQdvku70loqpYcYd0gBforezfb1rXT/wnkc11pde4HRw4/bQJoJtNG
kc5ycdM0HEKS6D59TfgWSCt+UwwPstrxnG9x8oC09NQsiqvsuqTDuih2gP7c
gPApQmvQOobZ91SbiSftTnDE6rnHVG2GTMhKZbip2si5QnsCs62lwxISWvtB
B2GpobjNtf1CvjNeNcsKtiRiYRauQIg6ls2su3vFSEvf/V1Cm9CYJZZso7bO
rgRgoMtUJ5BW8k2rZ2jCgpUYH6bcJ0Q0y0LLzbiLkFQMuMIzIydAOLazd+f3
7E1RfOi0RlGkbfwMUk2l3qOCtevGDtV01HNfQydLuQMrVlJiEYtMlRCd4G1t
Ckwvlh9oK/okkhJ6OG7aYv72xzlIM+eu7f6BUM4Ru4wF1xxFwordcrUF7GG2
RCID29sWfybSgUNgtvo+kLydYGry+wDL2w0aeB85BE2k541IBwVkkE7caj1x
VEgg5U8SqA1NsKziOjoldMSM6TVCApyQ616CGvdSgKzsF05xJ1eTffyi1s+1
JdewMayEOFxbeFg91XC/Y2tR28Bqp36fCR/W4TMGDzvOtsiqqQuzaJssl55/
jKh18/JOI8ub0E+cA8MmGMjc9YI3hLxwBL8arlonNil9FM2eh0a66VR9LQhH
wQ/8y6OV7g60KXeLRDE3c4/XxTFWtgFeTfUmFPdqeEMDOxDczo2BoSTZJPbF
dPZDC4Q66pI4ppKDA4LaNIWzQKLfIozGmlVs0zh/pnPZ5aUG56MCXdmh4VlX
XtNea1xPaczZ1H77vR73cVRqwD5sTdqhyC/ahYXtZdXccJBU6qsPJ9tIuHO4
2pJ2aeGEcobghll5B/zRPp5UpQnbincNd51VBc52si6vlfUyRJd80ftgPJDH
1W6baerjDauqWcRm5hBRfuziOX4IVwYet7n9o7qya+j6ZXSbTxfFdbhPmrox
ziXh4CC7NIbEH21ow2G+P4a+AG22wkAu/zuYr4F/AogGF5bHNcniGkRnxF1m
EtrkddllwXvEYHlJqV7CAtroBTOAEAlkJCKgX74Q3UQEdbcmyKZCUresM3TS
o4vSTLy6GHDDBWhapX9NMgYXmHB0E/DZmZlY1m+0J0UJzs5elSvATbiyiNQP
HQq9gQQmWJF9qPkMS2iqRS42fY9RaeHWE13aVNaX1UT6z9WBsrdnBjDT4EPq
nVgtWkb7YDvjt+D/Jet1N+JwZHqFuXNkaa5gD1TPMsAEEmHJV6VJ08sFeXd5
g6YK6cUvASe1Jl+n99cbsX/jUvSS+B8eZzmsP4ZPsdg/wHp6pRdRqKkfoCfu
hopO229KYZ4c90WDxIOGXhjSChPFs4FusJ5KBzaM5pS5qqWum7PXznFmvuWB
hQ6HYcKRVbnTparQBlVoplTh8N4c6fONNEIq0czvkbojMSvd8fYL17OpY728
cjGNcK+Fz0s6sLcvfRo0rUshHp5KX3Y+YMzKcVC2fejFmPV0cl7FbNR43Lx+
8kjCVbWdDhCp4ti5sBBDb3fSIsZL6OGFeRLBiuLtETbCvBysO+1lGcgn2z5p
/IRq7Ph2h9uIO8x+IySTa1f9pa8fmFqNb16imG6Y2yJsql0sPrmswol+PTS+
p/7wyMi4ktZ5+PC7T5+0LYpPiQ7LhlkcoZ7+5PgbV/t071tudfTaWdKKvcvY
idLakHYs/0JJ9cHrgIo+wO1p2zV5Hq7ZjXV+2POzP8ELha1JR5bdu2C9T5oN
ipd3ITufBNNLc11ZbUgAc9Gg5Io2DZ3FHaYfmrFKbmi6B343LE+nFx+gLuG1
gp0OwI8HSXv/6G9Cy5O7uFKBX10WnevzJq4M59M0aO7BGY+zttolOSpObIlk
RrSiZfcHwE+yr1eCQ1BNzBdltui0zy3O9XBqKHG677BHbg3OCssqsUOcuNI+
O67nA2um1P2yYRnPkKxEiGpKQSNGwABS5//+WbwDXLrROj6DzntBBypiJUaD
+rrJGBA2mL0IRVcGPO43oxubVEZEIBIXF2xWWk7XSNEyY9GIpsiFcwT+soL5
ziyddK41cRsAbpPOVdT/oWnGMNPE0v0M98PGHdaFm37DGCqraisRaq9x5ryN
4cpZRir5vp4+uRIOAo7ZwMIUXcZXkv7THsTpZE+52aDfKJr0/Vbbc1d2M8jf
3SAPboYZvG7suThfw3mrqprYqjCLYokOEQK0iGnxeepfAbfFtkeo+xmd4i0Z
RUCYhxyR6zOd3eL+8PHDPGoZahZ12ql0VI3H55Nls4z/H/fQQ76GxJRkyNBs
t2g2/nfALPg4YUJJeeETMvK2Ygr0iuUQIzS5Ou9akruzoVAyiybfaW91IZZn
XKlEk1w8B4s4wybdYpZkK9MyJTbAOCTSzvQxZyr2XlY8uqFaQq/en+fBF7Bp
ven6PRAJPm6tDQQjjr9Ne0SlFBORHsxEUObcXJTcBVApwohs+yVcTBTBukDW
3lv+3MFz254oFcCfpcxI7e2Jq4FVnKdw1vB4ep5Y6wrOXRzVyAMRDumlHkoa
05CraZzpz3j6NM/dtnBUJEg5zAA55B6ikekNxL4rGZ9NHxWfym6HTHrfTGag
bZqBhpKhxdS9LnASWiHBnDWUhkRZHSpduYn9zu40ZF6TUghAvBZN31fk/QHU
E6ASchYybbZm/OObhoiC8KZ2oLD0hNTxsLP8XGyBUq45FTPMmS0c/EWVY+ci
wiFvOIsv1nZxaEUN6bH07pk9OzfRZYahz752D4mtCm5+FfLi3GCq22y5Opqv
CB8jdofHU9w1+WbmO7fzVePwbxnQoAi+N+7q5Y9fjBqtDL1Sbbjib2tmA5wZ
TFJfSDUaf+OjAwlKAH2yA52apxIfUATfdKsohG35blKE+JCA7bsI8NgWjIrJ
fWkRclDxJUGSk+fu4H837/74p//7fnD5spLDmD/Q4GJgCYzRY+9PjXmHOrHN
oKeLb6N2+t742ojPuOMcexQyOO9gHP9K/97jhlauVlJl3tl3wWVDv/v3wKq+
W5AJfhlfCPX+2E3QlW//ExPTknXzjnNO87LtL+d8JwbP0H7+DE0yQwVeQaos
k2Zcoqej2kV2u9DvmTb8HcqrGKzIa3yE6F/NmWdeWfIgT36zqbzbi+eRaeF7
PH37XEzluSu8Z8IM+HKiAB9FnxjOy37i6+HC9dI512pLLx9XsYLh37398YTI
Q//dfS9389GP37wXCItvwhXuh3D2RpGoHJW/0RsAjRC+Tls8cj+2CIB9a8lw
xzbBaE1J+G7Ym19L+U9FVky83JUr94koiZt/0bMnx2Fmc5lZ6hseutjBEer2
7ORJPH0PdNee2mitvtHqIYwxaMeRRmySizYnCs1QATi4Sx1wRI6d3XI5hGbR
46sqkntC2AIZ7u5RggQOrQMM9+T+HCCwp5hr2/Q+3Obgq5ey1rUQlG7K0Rbx
CM/3FEuyNQYsO2A63OiIKRtdxIdS1AzZF8jqZs3g1tt7GsgQg0YGd4/Hd1Aw
Nwz3mgHmLvWdHBza/ckjy8PM7Ts//sl7e/hOG9RyOM439ESwR+4hEYDI+6Ph
s3ffDz/5hj95rK2WtJ9xVX1+11LZ6lAso03k0spzd2dectuSPBmXq0sNs9wi
NnpRfC/RwFOkHfjmOLrfRlD58rrHPoI2PKma3paW2jl3FYi8G4/2kbu49Q7b
qG19DNORLZgAHR9pMRi3V3DlBNJkPqmK7sJZC4GCQbIhtHBkpr+IWh1E2N/b
wAQx5FeoD7Pue1emHne2DX1TuH8I4gQBUftyy7WOTrzO7YtxR4boSKoqP5Qa
o86VuDB4yvGhb7yHRh/aAqSZPBH+zlli45ccyPEcwn38eK/fB3TI86K/avJu
vxqQuyS5H3VWs1daaR9I385TSrjRu05arw4Kc7W7KJOCa0SuySzZunRZif4D
3GeSMTCKVeQQWbYp8wAJYyhYek/Vu6gjbfc+hKwC1goLogcVpbQfze3QUZcc
EhuFuQGkk46ZjCJxIlYLqF1LS7KvidtDI+K4oemRMc99Mfk+k5TMItq253jA
/onY4v0p90dwGYaZNrdPdZ89JIksZDsaPc65+jGOO17Y6H0eCWTj4vPffhc3
Oh/NjijNiNPbnhy+dBS12veucSmvvm7qFehuSgbZwNr+TJr/EyT87dUMLJrg
XRz6wKTLJi13+zZ5X0+E30P4f2SM0banj37O/v9Tu3mxXXIxhOsvd+qhWXxn
Hv/xclvBbhkJTI5JFGook+KKM1C71AXxVtn70AdDjf2pyzkYUYQYM8dI6dg3
aQVEKMB7d7FdrfiSyNNx3DICWzNCH6rUkuddFdg2XJIdJxpTlci59DHjboCT
h5npuMwkl/i9F18boYZXbRFh31RsPnIQuDTw4IB0I9xhBOjbH8tzjTzjsj4j
8nQCoejbjvqpCNLAG9Nrn9w0PtB57JwVjqiGDpKJ9yDdAtn+ObXnjVxkEQqb
WqIwEPc125beGOtHnbL5Xpu426a7ah0VK7FbObpS9wdrX7YcfZVB2L8WAGlZ
X+PNg/5Oux/YwJ5Kc/mOS7qgn7JQOXGLFmQbK3KQaEpPLxELnsmU2FUfdB2h
bSrQfqVysRz/HqnQ+IFt0H04Ul6fnybT/XNgp45dAnpdJphi2APgfDYFBJar
r7O+x13zKI6WMVxtqIb84oZPLuxLa7p3POxsGpuqnuzXMcdFbuMYy/vy6Xkn
tAxXx/opJWFq51Ngd4RccSJPE7+DvgP077bcLy3o/rF90QzsJ/Jgu0IRiGFB
u2Yb1SvLXQ613PsmNS4X5y9dS4yQAAmNFLBPuO0tIkwQj7QoljPWWbtSDSS3
HojPsJT2yNZKYMMLBxz0b48twoHcJgWHgMZ0QWjlJL85xNmcu5IKyqglqNv0
GcPX8mYkXF2bsMId1CJ1kn6wUj1yxVKyk4AxcmWbomij/IqUusggZU978IDc
5aJlMcYQSqmTlS6Oft5vtZJXOietN9s+ZEtVIGatuAl+SVEBNO01v/BMYgco
4K/JLG/cNexPmzezpBd4Tsd9CY9Nyv03YYI68y50/r8uaBXfHcdZbHvdBRSJ
ZrkEKegWpPfV9dKdyfHEovDl5Qm8AvGsQSMKmQdkNPcxyUZX38Q344x2SUgp
YySVNbSUh8f2TaQiXbIhlxFdJbWuI1A0Vqt87gYea2haIRIW6RU9GA54k9rS
M5klX8SjsavJ9kQ5zfnkTuzyZythfwe7kcnGslb9Swn0RRsQnqRVI+qqekmg
Hg++ffjtp084rVmdAquS6L709qQzm/X+UrtwRZm82uE/3bmjNXBec7vmoBbo
h36nCppFz6rI/ujkW5z4wIUkRWQMiHxIZd4gI3vKaeo3N82cG6xy63l7GOJm
X/mw1RGa2+vm7HPpB/gtjs6PgWIaRGC7IFBNa1qTfLW3DY4Mt5cYWXTDF94a
VktaI3LUe9QEnOsMXt3aAWvQvzq9bCm6FjzGI5KcTW8/M/6L8LMkiN5NGdae
AjPtl49WInUyCXD1BOplooniK6AyzKDfpweGWL3qI3XJXN34+J4kzVlEhbDa
o/e6IK4AFMaJX5R+hkaG0y0LbdowcXxVmu8LEZpRdKGby7iFnkmuD/AtH4/0
rqZRyNlE3RyP9G625P4EyT2fjkIXJjSgifrjH/mYJie2DkdXDZjbrhqIL8Py
RuXZuRFVyOaz62R85DrIJLc9Ral1uVXHJLc9jXrH+Bqg0EHPxDQFCIADXE7V
dbd1W93TYRU5Hw5gbgZ9VrUq3nx2d9XQSBWvm2yhyty/twT+rA5KGVHYbSuN
8q+KajNMrIEn6lWvJWFla26rLAXn3FLZbW6v7OasuhcVUh20t7lBEBfVbgbE
0PIqqVzgKkgjiAttROAMcLXJ4qskgDphEnDXASggD2mTLsGR0inyvMs01/44
v+EUGJGE5NB5uSrRyc9fhh6p4kMe5wi1Za7TceRryb0BeZmzbajaOO6aJx3k
OAC54DgsVs29p4l4NJK0nfb4t3B9DMoveOVRtxsuHo26N2p3S1iQ3O2ITkwo
ppAbSQu+2igqjv6J6YHK6CR7lCf3A+iiNT080oVg7X/P6i0U/d07Jw9473GO
93b4FsoUSdkTxFIE5rWHDuEb+qB0R7PkaoRDvhMheGRHs6hDjFyHcMj3IMAv
O/IgY1mUWFLSQIeF/sm+NmCSQ+gnl8TK2Q8V3cWuIopLCKd0MM5mNB3jDKpb
tG/YtbfY0bdk76/MoK11HLujg1tkcOlXmYN8hJ5JJkImaTBgzZcncgp+mZGI
60MZAw1gIljmzdUuZfwAgu5EdLclTb3ZdiZ0Xbit7SaEkGsTi87zo+bcQMvG
uydxOY+ECMZ4hOBF4ACpfiv9GXt305bcyQdpI9mvve3VBUfviggYOjUndYIr
l5yFGrB+covCx4+Pfjp79vPTswtc3REVMTDILPVmJeHM2GoJYA6dVDQ6l6wa
4ENVw0B27ulTksxgv4RDNt5wchc9rqAt+5hgmNtFcc09CzBnbm8u9zn5PRQF
FleeoBIgYii5ws91/Ipv2hn3lY86gNU5o6JgxyO2gHx93MsDvfJLNQicUqK/
ExetXcNmP0Wv4v03Q29clqMy5xZw3cKNEoCeDH4sex/alriLJKFAoOUVHdV2
fpmtSz6quSQXB2240qtnrDbNiMW8Wnmuvhl3t7OzGYEyjHWhzmAmtytHkBdN
lLD0Jo/aco4qLP3cnw4jwXikaHJcAlaCOWhKdBarnev3H5+kgfAWdYTFsOR0
9TjWvYDFKjpvNB8UdnC2XaFykB7+zhU4Q43evX//5CE9x6cQ90zyBrgmYuqA
Prj3HRdvF3LVQCwQLQLmmd3ROsJRVSHB0eimvuR8qIJ3GRyFUtMtF6bcwIcP
l1MIdGrgWPyk2nngOp6pzWJ+2bOxM2e6RdcLqOoVuWVCf/D46oB9G+4v7kgb
UA1aSN5ohIWjiwHAVRho9bgbwd4WXlHxwEQpkDitIoTVqmoiJ4PvZchqw521
BWoV+munle1JVJqn7dSATw0JZoZ7kwytvdNAxtBaRMGFsGORa565HtrOQ5AI
MMwyRNmldgQVDWz1kSx7VVZNP12/jh5Broid28ABugldjdIWfh5N+QZXBvXa
NSNcXzS864hHN9Jcrcg4cXFqOdMG/5ftOt8S0OFX7aG/U8h3v0ib7XpRP5S4
nrW/H3byG1wmxPXpE638jmZ6zdEg76VWN/7EnW9c19MYD8J4dgm4XzVSOcH8
6y719JdVKRMPKzx4I5wFxFm0SwGw8tSlLJb2uuTOcO4iZxkQtUPsj0r7Xa9K
M70h3qlEbmJtXL/fYTQ4rZpMLokM9++Rgih/jaLm7gqcDh37MEm+h1pwtx66
53qnJXnBq+yv2LqZa7Fiom7QcUZQe27voTW36HYtQcV4W+i1ImzXipXN9pR+
qRNQy+ktgD2h6vhKE3cBgms+Pb4/BeypObVSbo/lWynpwcg685zOhV/eTtOQ
mTPTuGOAM9TgVE1fzAIeywE9F8EKQ29gQKSqPwAKB0bA7br/zWSvQ7xtuwFE
HfZIcp2aUCi8LcYdxrfAaJDO9dMT6y7FyOAqa0W9ZXpj8AjLDZPH226Qy1Md
+qW3bTxNfs7lPfZ1EoYMdAmIKJqhdzTFnW30JOIGacZS5d+H68BC4NG66+cD
4Goi8uEsnP1Zzs7PPGHVL7vkog53gKYu+9Fz7BIHI6VsS98TRy9HV7naufMw
xdZO1UdhUNcZKdj7YzPfoSDQZjUrK3gqvugVmgsF/E3Lratugsg0Ue8VFZId
es90cehTy1Swyv1y5P8DHaIFNha0AAA=

-->

</rfc>
