DPCrypto: Acceleration of Post-Quantum Cryptography Using Dot-Product Instructions on GPUs

被引:7
|
作者
Lee, Wai-Kong [1 ]
Seo, Hwajeong [2 ]
Hwang, Seong Oun [1 ]
Achar, Ramachandra [3 ]
Karmakar, Angshuman [4 ]
Mera, Jose Maria Bermudo [4 ]
机构
[1] Gachon Univ, Dept Comp Engn, Seongnam 13120, South Korea
[2] Hansung Univ, Dept Comp Engn, Seoul 02876, South Korea
[3] Carleton Univ, Dept Elect, Ottawa, ON K1S 5B6, Canada
[4] Katholieke Univ Leuven, COSIC, B-3000 Leuven, Belgium
基金
加拿大自然科学与工程研究理事会; 新加坡国家研究基金会;
关键词
Graphics processing units; Computer architecture; Cryptography; Convolution; Throughput; NIST; Standardization; Post-quantum cryptography; dot-product; polynomial convolution; matrix-multiplication; graphics processing unit; FrodoKEM and Saber; MULTIPLICATION; SCHEME;
D O I
10.1109/TCSI.2022.3176966
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Modern NVIDIA GPU architectures offer dot-product instructions (DP2A and DP4A), with the aim of accelerating machine learning and scientific computing applications. These dot-product instructions allow the computation of multiply-and-add instructions in a single clock cycle, effectively achieving higher throughput compared to conventional 32-bit integer units. In this paper, we show that the dot-product instruction can also be used to accelerate matrix-multiplication and polynomial convolution operations, which are widely used in post-quantum lattice-based cryptographic schemes. In particular, we propose a highly optimized implementation of FrodoKEM wherein the matrix-multiplication is accelerated by the dot-product instruction. We also present specially designed data structures that allow an efficient implementation of Saber key-encapsulation mechanism, utilizing the dot-product instruction to speed-up the polynomial convolution. The proposed FrodoKEM implementation achieves 4.37x higher throughput than the state-of-the-art implementation on a V100 GPU. This paper also presents the first implementation of Saber on GPU platforms, achieving 124,418, 120,463, and 31,658 key exchanges per second on RTX3080, V100, and T4 GPUs, respectively. Since matrix-multiplication and polynomial convolution operations are the most time-consuming operations in lattice-based cryptographic schemes, we strongly believe that the proposed methods can be beneficial to other KEM and signatures schemes based on lattices.
引用
收藏
页码:3591 / 3604
页数:14
相关论文
共 50 条
  • [21] Transitioning organizations to post-quantum cryptography
    Joseph, David
    Misoczki, Rafael
    Manzano, Marc
    Tricot, Joe
    Pinuaga, Fernando Dominguez
    Lacombe, Olivier
    Leichenauer, Stefan
    Hidary, Jack
    Venables, Phil
    Hansen, Royal
    NATURE, 2022, 605 (7909) : 237 - 243
  • [22] Post-Quantum Secure Inner Product Functional Encryption Using Multivariate Public Key Cryptography
    Debnath, Sumit Kumar
    Mesnager, Sihem
    Dey, Kunal
    Kundu, Nibedita
    MEDITERRANEAN JOURNAL OF MATHEMATICS, 2021, 18 (05)
  • [23] Post-quantum cryptography: lattice signatures
    Buchmann, Johannes
    Lindner, Richard
    Rueckert, Markus
    Schneider, Michael
    COMPUTING, 2009, 85 (1-2) : 105 - 125
  • [24] Post-Quantum Cryptography in WireGuard VPN
    Kniep, Quentin M.
    Mueller, Wolf
    Redlich, Jens-Peter
    SECURITY AND PRIVACY IN COMMUNICATION NETWORKS (SECURECOMM 2020), PT II, 2020, 336 : 261 - 267
  • [25] FPGA Accelerated Post-Quantum Cryptography
    Li, He
    Tang, Yongming
    Que, Zhiqiang
    Zhang, Jiliang
    IEEE TRANSACTIONS ON NANOTECHNOLOGY, 2022, 21 : 685 - 691
  • [26] Implementing Post-quantum Cryptography for Developers
    Hekkala, Julius
    Halunen, Kimmo
    Vallivaara, Visa
    PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS SECURITY AND PRIVACY (ICISSP), 2021, : 73 - 83
  • [27] Post-Quantum Secure Inner Product Functional Encryption Using Multivariate Public Key Cryptography
    Sumit Kumar Debnath
    Sihem Mesnager
    Kunal Dey
    Nibedita Kundu
    Mediterranean Journal of Mathematics, 2021, 18
  • [28] Developing Secure Messaging Software using Post-Quantum Cryptography
    Nguyen, Tat-Thang
    Luc, Nhu-Quynh
    Dao, Toan Thanh
    ENGINEERING TECHNOLOGY & APPLIED SCIENCE RESEARCH, 2023, 13 (06) : 12440 - 12445
  • [29] A post-quantum signcryption scheme using isogeny based cryptography
    Dey, Kunal
    Debnath, Sumit Kumar
    Stanica, Pantelimon
    Srivastava, Vikas
    JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2022, 69
  • [30] A Quantum of QUIC: Dissecting Cryptography with Post-Quantum Insights
    Kempf, Marcel
    Gauder, Nikolas
    Jaeger, Benedikt
    Zirngibl, Johannes
    Carle, Georg
    2024 23RD IFIP NETWORKING CONFERENCE, IFIP NETWORKING 2024, 2024, : 186 - 194