Paper 2026/2705

SpreadMAYO: Unlocking Greater Parallelism for Faster MAYO Signatures on GPUs

Zhuoyu Xie, University of Chinese Academy of Sciences
Tian Zhou, University of Science and Technology of China
Fangyu Zheng, University of Chinese Academy of Sciences
Yijing Ning, University of Science and Technology of China
Yi Bian, University of Chinese Academy of Sciences
Wangchen Dai, Sun Yat-sen University
Jiankuo Dong, University of Science and Technology of China
Yuewu Wang, University of Chinese Academy of Sciences
Jingqiang Lin, University of Science and Technology of China
Jiwu Jing, University of Chinese Academy of Sciences
Abstract

Quantum computing threatens public-key cryptography, motivating post-quantum signature standardization. MAYO, a multivariate Round 3 candidate in NIST's additional signature process, offers compact keys and signatures. However, prior GPU implementations do not fully exploit parallelism within each MAYO operation: equation-slice partitioning serializes independent matrix work, while signing requires frequent synchronization among threads during linear-system construction and elimination. We present SpreadMAYO, a high-throughput GPU implementation of MAYO Round 3 that exposes greater parallelism and reduces synchronization through finer task partitioning and a revised signing pipeline. SpreadMAYO distributes matrix contractions across rows, output positions, and 64-bit limbs while reusing operands in registers. Each limb packs sixteen GF(16) coefficients; native 32-bit operations process its halves without lookup tables. For signing, threads privately accumulate columns with deferred polynomial reduction, transpose packed columns into rows using warp shuffles, and eliminate rows below each pivot in parallel. Additionally, we employ a hybrid AES design to accommodate different workloads and fuse key expansion with matrix computations to reduce global-memory traffic. On an NVIDIA GeForce RTX 4090, SpreadMAYO outperforms the Round 3 adapted GPU baseline by 2.33–3.71× in key generation, 4.40–6.93× in signing, and 3.42–5.13× in verification, reaching up to 10.75× in repeated-key server signing.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint.
Keywords
Digital signaturesfinite-field arithmeticGPU accelerationMAYOpost-quantum cryptography
Contact author(s)
xiezhuoyu25 @ mails ucas ac cn
weekdayzt @ ustc edu cn
zhengfangyu @ ucas ac cn
truegeorge @ mail ustc edu cn
bianyi @ ucas ac cn
daiwch @ mail sysu edu cn
djiankuo @ ustc edu cn
wangyuewu @ ucas ac cn
linjq @ ustc edu cn
jwjing @ ucas ac cn
History
2026-11-04: approved
2026-10-31: received
See all versions
Short URL
https://ia.cr/2026/2705
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/2705,
      author = {Zhuoyu Xie and Tian Zhou and Fangyu Zheng and Yijing Ning and Yi Bian and Wangchen Dai and Jiankuo Dong and Yuewu Wang and Jingqiang Lin and Jiwu Jing},
      title = {{SpreadMAYO}: Unlocking Greater Parallelism for Faster {MAYO} Signatures on {GPUs}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2705},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2705}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.