Mckeycutter: A High-throughput Key Generator of Classic McEliece on Hardware
Yihong Zhu, Wenping Zhu, Chen Chen, Min Zhu, Zhengdong Li, Shaojun Wei, Leibo Liu
摘要
Classic McEliece is a code-based quantum-resistant public-key scheme characterized with relative high encapsulation/decapsulation speed and small ciphertexts, with an in-depth analysis on its security. However, slow key generation with large public key size make it hard for wider applications. Based on this observation, Mckeycutter, a high-throughput key generator in hardware, is proposed to accelerate the key generation in Classic McEliece based on algorithm-hardware co-design. Meanwhile the storage overhead caused by large-size keys is also minimized. First, compact large-size GF(2) Gauss elimination is presented by adopting naive processing array, singular matrix detection-based early abort, and memory-friendly scheduling strategy. Second, an optimized constant-time hardware sorter is proposed to support regular memory accesses with less comparators and storage. Third, algorithm-level pipeline is enabled for high-throughput processing, allowing for concurrent key generation based on decoupling between data access and computation Our FPGA implementation results achieve around 4× improvements in throughput with 9∼14× less memory-time product compared with the existing FPGA solutions.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper1
相关 Paper
- Message-Recovery Laser Fault Injection Attack on the Classic McEliece CryptosystemPierre-Louis Cayrel, Brice Colombier, Vlad-Florin Dragoi, Alexandre Menu 等EUROCRYPT 2021 · 被引用 28 次
- ACIM-QMM: Efficient Analog Computing-in-Memory Accelerator for QC-MDPC McEliece CryptosystemPingdan Xiao, Zhengmiao Wei, Sichun Du, Wanli Chang 等DAC 2025
- The syzygy DistinguisherHugues RandriambololonaEUROCRYPT 2025 · 被引用 10 次
- Whipping the Multivariate-based MAYO Signature Scheme using Hardware PlatformsFlorian Hirner, Michael Streibl, Florian Krieger, Ahmet Can Mert 等CCS 2024 · 被引用 2 次
- Distinguishing Goppa Codes Using Higher-Order VanishingTobias Hemmert, Andreas WiemersCRYPTO 2026 · 被引用 2 次
