1. qDSA: Small and Secure Digital Signatureswith Curve-based Diffie–Hellman Key Pairs 2017 Asiacrypt EllipticCurves
    Joost Renes and Benjamin Smith
    [View PDF on arxiv.org]
    [Show BibTex Citation]

    @article{DBLP:journals/corr/abs-1709-03358,
    author = {Joost Renes and
    Benjamin Smith},
    title = {qDSA: Small and Secure Digital Signatures with Curve-based Diffie-Hellman
    Key Pairs},
    journal = {CoRR},
    volume = {abs/1709.03358},
    year = {2017},
    url = {http://arxiv.org/abs/1709.03358},
    archivePrefix = {arXiv},
    eprint = {1709.03358},
    timestamp = {Mon, 13 Aug 2018 16:46:49 +0200},
    biburl = {https://dblp.org/rec/bib/journals/corr/abs-1709-03358},
    bibsource = {dblp computer science bibliography, https://dblp.org}
    }

qDSA is a high-speed, high-security signature scheme that facilitates implementations with a very small memory footprint, a crucial requirement for embedded systems and IoT devices, and that uses the same public keys as modern Diffie–Hellman schemes based on Montgomery curves (such as Curve25519) or Kummer surfaces. qDSA resembles an adaptation of EdDSA to the world of Kummer varieties, which are quotients of algebraic groups by ±1. Interestingly, qDSA does not require any full group operations or point recovery: all computations, including signature verification, occur on the quotient where there is no group law. We include details on four implementations of qDSA, using Montgomery and fast Kummer surface arithmetic on the 8-bit AVR ATmega and 32-bit ARM Cortex M0 platforms. We find that qDSA significantly outperforms state-of-the-art signature implementations in terms of stack usage and code size. We also include an efficient compression algorithm for points on fast Kummer surfaces, reducing them to the same size as compressed elliptic curve points for the same security level.

  1.