Paper 2026/2540

Efficient and Compact High-order Masking Raccoon on Memory Constrained Devices

Junhao Huang, Singapore Management University, Singapore
Yiteng Sun, Shandong University, Qingdao, China
Jipeng Zhang, National University of Singapore, Singapore
Weijia Wang, Shandong University, Qingdao, China
Donglong Chen, Beijing Normal-Hong Kong Baptist University, Zhuhai, China
Haiyang Xue, Singapore Management University, Singapore
Guomin Yang, Singapore Management University, Singapore
Abstract

Raccoon, presented at CRYPTO 2024, is a provably secure lattice-based signature scheme featuring an $O(d \log{d})$ masking overhead. Although it did not advance beyond the first-round of NIST's additional call for post-quantum digital signatures, Raccoon remains a promising candidate due to its low masking overhead and strong provable side-channel resistance. This paper proposes the first efficient and compact implementation of high-order Raccoon on the ARM Cortex-M4, with a focus on optimizing its polynomial multiplication, sampling, and memory consumption. 1) For polynomial multiplication, we present a consecutive 32-bit NTT/INTT implementation for the two moduli in Raccoon, enabling optimal 3+3+3 layer merging to reduce memory-access overhead, together with extensive lazy reduction to minimize modular reductions. As a side contribution, we propose a novel negative double Montgomery reduction technique to accelerate double modular reductions in multi-moduli NTT. 2) For polynomial sampling, we identify and resolve a previously overlooked performance bottleneck caused by frequent incremental SHAKE256 invocations for small data chunks on ARM Cortex-M4. By transitioning to the one-shot approach, we achieve speedups of at least $1.80\times$ across all sampling routines in Raccoon. 3) Finally, we explore memory-saving techniques to enable the practical deployment of high-order masked Raccoon (up to 32 orders) on resource-constrained IoT devices. The proposed implementations outperform the Raccoon reference implementation by $1.85\times$-$2.25\times$. Notably, high-order masked Raccoon-192 outperforms masked Dilithium3 by $3.12\times, 8.07\times$, and $2.71\times$ at masking orders $d=2$, $4$, and $8$, respectively. Finally, the leakage evaluations confirm that the second-order Raccoon implementation provides strong resistance to differential power analysis (DPA) once micro-architectural transitional leakages are mitigated.

Note: Figure 1 and the stack usage of Table 4 have been minorly updated after the artifact evaluation of TCHES2026.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
A minor revision of an IACR publication in TCHES 2026
DOI
10.46586/tches.v2026.i4.369-396
Keywords
Raccoon signatureside-channel attacksmodular arithmeticlattice-based cryptography
Contact author(s)
jhhuang_nuaa @ 126 com
sunyiteng @ mail sdu edu cn
jp-zhang @ outlook com
wjwang @ sdu edu cn
donglongchen @ bnbu edu cn
haiyangxue @ smu edu sg
gmyang @ smu edu sg
History
2026-10-20: approved
2026-10-19: received
See all versions
Short URL
https://ia.cr/2026/2540
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/2540,
      author = {Junhao Huang and Yiteng Sun and Jipeng Zhang and Weijia Wang and Donglong Chen and Haiyang Xue and Guomin Yang},
      title = {Efficient and Compact High-order Masking Raccoon on Memory Constrained Devices},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2540},
      year = {2026},
      doi = {10.46586/tches.v2026.i4.369-396},
      url = {https://eprint.iacr.org/2026/2540}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.