Constant-time integer arithmetic for SQIsign

DOI10.1007/978-3-031-97260-7_10MaRDI QIDQ6877586zbMATH OpenFDO

Authors Fatna Kouider, Anisha Mukherjee, David Jacquemin, Péter Kutas

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-97260-7_10

zbMATH Keywords

big integer arithmeticconstant-time implementationSQIsign

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• scientific article; zbMATH DE number 1979291 (Why is no real title available?)
• Modular Multiplication Without Trial Division
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quaternion algebras
• Speeding the Pollard and Elliptic Curve Methods of Factorization

This page was built for publication: Constant-time integer arithmetic for SQIsign

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877586)