@techreport{pq-pkix-problem-statement-01,
    number =    {draft-pq-pkix-problem-statement-01},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-pq-pkix-problem-statement/01/},
    author =    {Mike Ounsworth},
    title =     {{Post-quantum Multi-Key Mechanisms for PKIX-like protocols; Problem Statement and Overview of Solution Space}},
    pagetotal = 9,
    year =      2019,
    month =     sep,
    day =       17,
    abstract =  {With the widespread adoption of post-quantum (PQ) cryptography will come uncertainty about the strength of cryptographic primitives. For example; when will RSA and ECC fall? Are Lattice schemes as strong as we believe? The cryptographic community is calling for hybrid schemes that combine classic and post-quantum crypto in ways that remain strong so long as at least one of the algorithms used remains strong. This document defines the problem statement for digital signatures in PKIX-like protocols, and gives an overview of the general families of solutions.},
}