Library for Multiprecision Compile-Time and Run-Time Arithmetic (including Modular Arithmetic)
-
Updated
Oct 4, 2024 - C++
Library for Multiprecision Compile-Time and Run-Time Arithmetic (including Modular Arithmetic)
Formal Verification of secp256k1 modular scalar multiplication
We implement the Schnorr proof system in assembler via the Jasmin toolchain, and prove the security (proof-of-knowledge and zero-knowledge) and the absence of leakage through timing side-channels of that implementation in EasyCrypt.
Tiny Kotlin DSL for modular arithmetik
BBP Type Formulas for Calculating the nth-digit of Pi Concurrently.
Browser-based educational simulation of the KyberSlash timing attacks on ML-KEM (Kyber) — secret-dependent division in poly_tomsg and poly_compress. Based on the CHES 2025 Best Paper. Vulnerable code, Barrett-reduction fix, and live attack simulation.
Add a description, image, and links to the barrett-reduction topic page so that developers can more easily learn about it.
To associate your repository with the barrett-reduction topic, visit your repo's landing page and select "manage topics."