Accelerating and verifying constant-time modular inversion

DOI10.1007/978-3-032-25336-1_21MaRDI QIDQ7305313zbMATH OpenFDO

Authors Daniel J. Bernstein, Han-Ting Chen, John R. Harrison, Cesare Huang, Gregory Maxwell, Bow-Yaw Wang, Pieter Wuille, Bo-Yin Yang

Publication date 29 July 2026

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• An axiomatic basis for computer programming
• Another efficient algorithm for convex hulls in two dimensions
• Candle: a verified implementation of HOL light
• Computational problems associated with Racah algebra
• Convex functions. Constructions, characterizations and counterexamples
• Efficient arithmetic in (pseudo-)Mersenne prime order fields
• Efficient formal verification of bounds of linear programs
• Euclid's algorithm for large numbers.
• Hoare Logic for ARM Machine Code
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• Public Key Cryptography - PKC 2006
• Quantum resource estimates for computing elliptic curve discrete logarithms
• The Mathematics of the Pentium Division Bug
• The Montgomery inverse and its applications
• Timing attacks against the syndrome inversion in code-based cryptosystems
• Towards Self-verification of HOL Light

This page was built for publication: Accelerating and verifying constant-time modular inversion

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