Paper 2026/2439
Efficient Vectorized Implementation of MQOM
Abstract
Post-quantum signature schemes require efficient implementations to be viable in practice. MQOM, a third-round candidate in NIST’s additional call for digital signatures, is a promising target for SIMD optimization. This work leverages a transpose-enabled paired-matrix trick to develop a vectorized implementation of MQOM v2.1, corresponding to the Round-2 specification, with reduced wasted SIMD work and memory traffic. We evaluate MQOM v2.1 on Arm NEON, x86 AVX2, and x86 AVX-512, covering key generation, signing, verification, and memory; peak dynamic memory falls by up to 39.43%. We also include supplementary MQOM v3 experiments to assess how the matrix-layout optimization transfers to the Round-3 code.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- MQOMPost Quantum CryptographyDigital Signature Scheme
- Contact author(s)
-
davidafonsods @ gmail com
jlopez @ unicamp br
francisco rodriguez @ tii ae - History
- 2026-10-14: approved
- 2026-10-10: received
- See all versions
- Short URL
- https://ia.cr/2026/2439
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2439,
author = {David Santos and Julio López and Francisco Rodríguez-Henríquez},
title = {Efficient Vectorized Implementation of {MQOM}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2439},
year = {2026},
url = {https://eprint.iacr.org/2026/2439}
}
