Efficient FPGA Implementations of LowMC and Picnic

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

Abstract

Post-quantum cryptography has received increased attention in recent years, in particular, due to the standardization effort by NIST. One of the second-round candidates in the NIST post-quantum standardization project is Picnic, a post-quantum secure signature scheme based on efficient zero-knowledge proofs of knowledge. In this work, we present the first FPGA implementation of Picnic. We show how to efficiently calculate LowMC, the block cipher used as a one-way function in Picnic, in hardware despite the large number of constants needed during computation. We then combine our LowMC implementation and efficient instantiations of Keccak to build the full Picnic algorithm. Additionally, we conform to recently proposed hardware interfaces for post-quantum schemes to enable easier comparisons with other designs. We provide evaluations of our Picnic implementation for both, the standalone design and a version wrapped with a PCIe interface, and compare them to the state-of-the-art software implementations of Picnic and similar hardware designs. Concretely, signing messages on our FPGA takes 0.25 ms for the L1 security level and 1.24 ms for the L5 security level, beating existing optimized software implementations by a factor of 4.
Originalspracheenglisch
TitelTopics in Cryptology – CT-RSA 2020
UntertitelThe Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings
Redakteure/-innenStanislaw Jarecki
ErscheinungsortSan Francisco, CA, USA
Herausgeber (Verlag)Springer
PublikationsstatusAngenommen/In Druck - 2019

Fingerprint

Field programmable gate arrays (FPGA)
Hardware
Standardization
Quantum cryptography

Schlagwörter

    Dies zitieren

    Kales, D., Ramacher, S., Rechberger, C., Walch, R., & Werner, M. (Angenommen/Im Druck). Efficient FPGA Implementations of LowMC and Picnic. in S. Jarecki (Hrsg.), Topics in Cryptology – CT-RSA 2020: The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings San Francisco, CA, USA: Springer.

    Efficient FPGA Implementations of LowMC and Picnic. / Kales, Daniel; Ramacher, Sebastian; Rechberger, Christian; Walch, Roman; Werner, Mario.

    Topics in Cryptology – CT-RSA 2020: The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings. Hrsg. / Stanislaw Jarecki. San Francisco, CA, USA : Springer, 2019.

    Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

    Kales, D, Ramacher, S, Rechberger, C, Walch, R & Werner, M 2019, Efficient FPGA Implementations of LowMC and Picnic. in S Jarecki (Hrsg.), Topics in Cryptology – CT-RSA 2020: The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings. Springer, San Francisco, CA, USA.
    Kales D, Ramacher S, Rechberger C, Walch R, Werner M. Efficient FPGA Implementations of LowMC and Picnic. in Jarecki S, Hrsg., Topics in Cryptology – CT-RSA 2020: The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings. San Francisco, CA, USA: Springer. 2019
    Kales, Daniel ; Ramacher, Sebastian ; Rechberger, Christian ; Walch, Roman ; Werner, Mario. / Efficient FPGA Implementations of LowMC and Picnic. Topics in Cryptology – CT-RSA 2020: The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings. Hrsg. / Stanislaw Jarecki. San Francisco, CA, USA : Springer, 2019.
    @inproceedings{e4bbcc417b084b1f9476d1d191f1a1d2,
    title = "Efficient FPGA Implementations of LowMC and Picnic",
    abstract = "Post-quantum cryptography has received increased attention in recent years, in particular, due to the standardization effort by NIST. One of the second-round candidates in the NIST post-quantum standardization project is Picnic, a post-quantum secure signature scheme based on efficient zero-knowledge proofs of knowledge. In this work, we present the first FPGA implementation of Picnic. We show how to efficiently calculate LowMC, the block cipher used as a one-way function in Picnic, in hardware despite the large number of constants needed during computation. We then combine our LowMC implementation and efficient instantiations of Keccak to build the full Picnic algorithm. Additionally, we conform to recently proposed hardware interfaces for post-quantum schemes to enable easier comparisons with other designs. We provide evaluations of our Picnic implementation for both, the standalone design and a version wrapped with a PCIe interface, and compare them to the state-of-the-art software implementations of Picnic and similar hardware designs. Concretely, signing messages on our FPGA takes 0.25 ms for the L1 security level and 1.24 ms for the L5 security level, beating existing optimized software implementations by a factor of 4.",
    keywords = "digital signatures, NIST PQC, PICNIC signature scheme, FPGA, implementation",
    author = "Daniel Kales and Sebastian Ramacher and Christian Rechberger and Roman Walch and Mario Werner",
    year = "2019",
    language = "English",
    editor = "Stanislaw Jarecki",
    booktitle = "Topics in Cryptology – CT-RSA 2020",
    publisher = "Springer",

    }

    TY - GEN

    T1 - Efficient FPGA Implementations of LowMC and Picnic

    AU - Kales, Daniel

    AU - Ramacher, Sebastian

    AU - Rechberger, Christian

    AU - Walch, Roman

    AU - Werner, Mario

    PY - 2019

    Y1 - 2019

    N2 - Post-quantum cryptography has received increased attention in recent years, in particular, due to the standardization effort by NIST. One of the second-round candidates in the NIST post-quantum standardization project is Picnic, a post-quantum secure signature scheme based on efficient zero-knowledge proofs of knowledge. In this work, we present the first FPGA implementation of Picnic. We show how to efficiently calculate LowMC, the block cipher used as a one-way function in Picnic, in hardware despite the large number of constants needed during computation. We then combine our LowMC implementation and efficient instantiations of Keccak to build the full Picnic algorithm. Additionally, we conform to recently proposed hardware interfaces for post-quantum schemes to enable easier comparisons with other designs. We provide evaluations of our Picnic implementation for both, the standalone design and a version wrapped with a PCIe interface, and compare them to the state-of-the-art software implementations of Picnic and similar hardware designs. Concretely, signing messages on our FPGA takes 0.25 ms for the L1 security level and 1.24 ms for the L5 security level, beating existing optimized software implementations by a factor of 4.

    AB - Post-quantum cryptography has received increased attention in recent years, in particular, due to the standardization effort by NIST. One of the second-round candidates in the NIST post-quantum standardization project is Picnic, a post-quantum secure signature scheme based on efficient zero-knowledge proofs of knowledge. In this work, we present the first FPGA implementation of Picnic. We show how to efficiently calculate LowMC, the block cipher used as a one-way function in Picnic, in hardware despite the large number of constants needed during computation. We then combine our LowMC implementation and efficient instantiations of Keccak to build the full Picnic algorithm. Additionally, we conform to recently proposed hardware interfaces for post-quantum schemes to enable easier comparisons with other designs. We provide evaluations of our Picnic implementation for both, the standalone design and a version wrapped with a PCIe interface, and compare them to the state-of-the-art software implementations of Picnic and similar hardware designs. Concretely, signing messages on our FPGA takes 0.25 ms for the L1 security level and 1.24 ms for the L5 security level, beating existing optimized software implementations by a factor of 4.

    KW - digital signatures

    KW - NIST PQC

    KW - PICNIC signature scheme

    KW - FPGA

    KW - implementation

    M3 - Conference contribution

    BT - Topics in Cryptology – CT-RSA 2020

    A2 - Jarecki, Stanislaw

    PB - Springer

    CY - San Francisco, CA, USA

    ER -