A new multiscalar multiplication method resistant to timing attacks

DOI10.1007/978-3-032-22931-1_7MaRDI QIDQ7348993zbMATH OpenFDO

Authors Abhraneel Dutta, Veronika Kuchta, Francesco Sica

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-22931-1_7

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Exponent Recoding and Regular Exponentiation Algorithms
• Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography
• scientific article; zbMATH DE number 1962161 (Why is no real title available?)
• scientific article; zbMATH DE number 2044541 (Why is no real title available?)
• scientific article; zbMATH DE number 1842492 (Why is no real title available?)
• On the size of pairing-based non-interactive arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Speeding up multi-scalar multiplications for pairing-based zkSNARKs

This page was built for publication: A new multiscalar multiplication method resistant to timing attacks

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