Constant-Time Integer Arithmetic for SQIsign

Kouider, Fatna and Mukherjee, Anisha and Jacquemin, David and Kutas, Péter (2026) Constant-Time Integer Arithmetic for SQIsign. LECTURE NOTES IN COMPUTER SCIENCE, 15651. pp. 192-215. ISSN 0302-9743

Text 2025-832.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

SQIsign, the only isogeny-based signature scheme submitted to NIST’s additional signature standardization call, achieves the smallest public key and signature sizes among all post-quantum signature schemes. However, its existing implementation, particularly in its quaternion arithmetic operations, relies on GMP’s big integer functions, which, while efficient, are often not designed for constant-time execution. In this work, we take a step toward side-channel-protected SQIsign by implementing constant-time techniques for SQIsign’s big integer arithmetic, which forms the computational backbone of its quaternion module. For low-level fundamental functions including Euclidean division, exponentiation and the function that computes integer square root, we either extend or tailor existing solutions according to SQIsign’s requirements such as handling signed integers or scaling them for integers up to ∼12,000 bits. Further, we propose a novel constant-time modular reduction technique designed to handle dynamically changing moduli. Our implementation is written in C without reliance on high-level libraries such as GMP and we evaluate the constant-time properties of our implementation using Timecop with Valgrind that confirm the absence of timing-dependent execution paths. We provide experimental benchmarks across various SQIsign parameter sizes to demonstrate the performance of our constant-time implementation.

Actions (login required)

Edit Item