CUSPX:后量子签名 SPHINCS+ 的高效 GPU 实现

IF 3.6 2区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Ziheng Wang;Xiaoshe Dong;Heng Chen;Yan Kang;Qiang Wang
{"title":"CUSPX:后量子签名 SPHINCS+ 的高效 GPU 实现","authors":"Ziheng Wang;Xiaoshe Dong;Heng Chen;Yan Kang;Qiang Wang","doi":"10.1109/TC.2024.3457736","DOIUrl":null,"url":null,"abstract":"Quantum computers pose a serious threat to existing cryptographic systems. While Post-Quantum Cryptography (PQC) offers resilience against quantum attacks, its performance limitations often hinder widespread adoption. Among the three National Institute of Standards and Technology (NIST)-selected general-purpose PQC schemes, SPHINCS\n<inline-formula><tex-math>${}^{+}$</tex-math></inline-formula>\n is particularly susceptible to these limitations. We introduce CUSPX (\n<u>CU</u>\nDA \n<u>SP</u>\nHIN\n<u>CS</u>\n \n<inline-formula><tex-math>${}^{+}$</tex-math></inline-formula>\n), the first large-scale parallel implementation of SPHINCS\n<inline-formula><tex-math>${}^{+}$</tex-math></inline-formula>\n capable of running across 10,000 cores. CUSPX leverages a novel three-level parallelism framework, applying it to \n<i>algorithmic parallelism</i>\n, \n<i>data parallelism</i>\n, and \n<i>hybrid parallelism</i>\n. Notably, CUSPX introduces parallel Merkle tree construction algorithms for arbitrary parallel scales and several load-balancing solutions, further enhancing performance. By treating tasks parallelism as the top level of parallelism, CUSPX provides a four-level parallel scheme that can run with any number of tasks. Evaluated on a single GeForce RTX 3090 using the SPHINCS\n<inline-formula><tex-math>${}^{+}$</tex-math></inline-formula>\n-SHA-256-128s-simple parameter set, CUSPX achieves a single task's signature generation latency of 0.67 ms, demonstrating a 5,105\n<inline-formula><tex-math>$\\times$</tex-math></inline-formula>\n speedup over a single-thread version and an 18.50\n<inline-formula><tex-math>$\\times$</tex-math></inline-formula>\n speedup over the previous fastest implementation.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"74 1","pages":"15-28"},"PeriodicalIF":3.6000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CUSPX: Efficient GPU Implementations of Post-Quantum Signature SPHINCS+\",\"authors\":\"Ziheng Wang;Xiaoshe Dong;Heng Chen;Yan Kang;Qiang Wang\",\"doi\":\"10.1109/TC.2024.3457736\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quantum computers pose a serious threat to existing cryptographic systems. While Post-Quantum Cryptography (PQC) offers resilience against quantum attacks, its performance limitations often hinder widespread adoption. Among the three National Institute of Standards and Technology (NIST)-selected general-purpose PQC schemes, SPHINCS\\n<inline-formula><tex-math>${}^{+}$</tex-math></inline-formula>\\n is particularly susceptible to these limitations. We introduce CUSPX (\\n<u>CU</u>\\nDA \\n<u>SP</u>\\nHIN\\n<u>CS</u>\\n \\n<inline-formula><tex-math>${}^{+}$</tex-math></inline-formula>\\n), the first large-scale parallel implementation of SPHINCS\\n<inline-formula><tex-math>${}^{+}$</tex-math></inline-formula>\\n capable of running across 10,000 cores. CUSPX leverages a novel three-level parallelism framework, applying it to \\n<i>algorithmic parallelism</i>\\n, \\n<i>data parallelism</i>\\n, and \\n<i>hybrid parallelism</i>\\n. Notably, CUSPX introduces parallel Merkle tree construction algorithms for arbitrary parallel scales and several load-balancing solutions, further enhancing performance. By treating tasks parallelism as the top level of parallelism, CUSPX provides a four-level parallel scheme that can run with any number of tasks. Evaluated on a single GeForce RTX 3090 using the SPHINCS\\n<inline-formula><tex-math>${}^{+}$</tex-math></inline-formula>\\n-SHA-256-128s-simple parameter set, CUSPX achieves a single task's signature generation latency of 0.67 ms, demonstrating a 5,105\\n<inline-formula><tex-math>$\\\\times$</tex-math></inline-formula>\\n speedup over a single-thread version and an 18.50\\n<inline-formula><tex-math>$\\\\times$</tex-math></inline-formula>\\n speedup over the previous fastest implementation.\",\"PeriodicalId\":13087,\"journal\":{\"name\":\"IEEE Transactions on Computers\",\"volume\":\"74 1\",\"pages\":\"15-28\"},\"PeriodicalIF\":3.6000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Computers\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10677363/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computers","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10677363/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

量子计算机对现有的密码系统构成严重威胁。虽然后量子密码学(PQC)提供了抗量子攻击的弹性,但其性能限制往往阻碍了广泛采用。在美国国家标准与技术研究所(NIST)选定的三个通用PQC方案中,SPHINCS${}^{+}$特别容易受到这些限制的影响。我们引入CUSPX (CUDA SPHINCS${}^{+}$),这是SPHINCS${}^{+}$的第一个大规模并行实现,能够在10,000个内核上运行。CUSPX利用一种新的三层并行框架,将其应用于算法并行、数据并行和混合并行。值得注意的是,CUSPX引入了任意并行尺度的并行Merkle树构建算法和几种负载平衡解决方案,进一步提高了性能。通过将任务并行性视为并行性的顶层,CUSPX提供了一个可以运行任意数量任务的四层并行方案。在单个GeForce RTX 3090上使用SPHINCS${}^{+}$- sha -256-128s简单参数集进行评估,CUSPX实现了单个任务签名生成延迟为0.67 ms,比单线程版本加速了5,105$\times$,比之前最快的实现加速了18.50$\times$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CUSPX: Efficient GPU Implementations of Post-Quantum Signature SPHINCS+
Quantum computers pose a serious threat to existing cryptographic systems. While Post-Quantum Cryptography (PQC) offers resilience against quantum attacks, its performance limitations often hinder widespread adoption. Among the three National Institute of Standards and Technology (NIST)-selected general-purpose PQC schemes, SPHINCS ${}^{+}$ is particularly susceptible to these limitations. We introduce CUSPX ( CU DA SP HIN CS ${}^{+}$ ), the first large-scale parallel implementation of SPHINCS ${}^{+}$ capable of running across 10,000 cores. CUSPX leverages a novel three-level parallelism framework, applying it to algorithmic parallelism , data parallelism , and hybrid parallelism . Notably, CUSPX introduces parallel Merkle tree construction algorithms for arbitrary parallel scales and several load-balancing solutions, further enhancing performance. By treating tasks parallelism as the top level of parallelism, CUSPX provides a four-level parallel scheme that can run with any number of tasks. Evaluated on a single GeForce RTX 3090 using the SPHINCS ${}^{+}$ -SHA-256-128s-simple parameter set, CUSPX achieves a single task's signature generation latency of 0.67 ms, demonstrating a 5,105 $\times$ speedup over a single-thread version and an 18.50 $\times$ speedup over the previous fastest implementation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Computers
IEEE Transactions on Computers 工程技术-工程:电子与电气
CiteScore
6.60
自引率
5.40%
发文量
199
审稿时长
6.0 months
期刊介绍: The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field. It publishes papers on research in areas of current interest to the readers. These areas include, but are not limited to, the following: a) computer organizations and architectures; b) operating systems, software systems, and communication protocols; c) real-time systems and embedded systems; d) digital devices, computer components, and interconnection networks; e) specification, design, prototyping, and testing methods and tools; f) performance, fault tolerance, reliability, security, and testability; g) case studies and experimental and theoretical evaluations; and h) new and important applications and trends.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信