I have taken it and modularized it in the sense of c++20 Modules. I have also
absorbed it into lam:: namespace. Besides
formal_verification-- see theSTATUS.mdfile inside that folderlibffis currently not included in the benchmarks
everything else should function the same as commit 2d27c34 of the original library.
Full disclosure, I did have some help from Gemini in refactoring, troubleshooting, and fixing build errors!
This is a c++ module template library for fixed-width "small big-integer" computations, for use during run-time as well as compile-time. By "small big integers", we mean numbers with a few limbs (in other words, a few hundred bits), typically occurring in cryptographic applications.
Important note: not all functions in the library are constant-time (when used at run-time); only those for which this is explicitly indicated.
Currently, the library is a work in progress and supports the following operations
- addition, formal verification: correctness using SAW and constant-timeness using ct-verif
- subtraction,
- multiplication (naive
$O(n^2)$ "schoolbook" multiplication) constant-time-verified using ct-verif
- division: short division (single-limb divisor) and Donald Knuth's "algorithm D"
- division: Granlund--Montgomery division by invariant integer (gives constant-time modulo reduction),
- comparison constant-time-verified using ct-verif
- modular addition,
- extended GCD and modular inverse,
- Barrett reduction,
- Montgomery reduction,
- Montgomery multiplication,
- Modular exponentiation (based on Montgomery multiplication)
- Compile-time initialization from a base-10 literal
- Serialization to ostream as base-10 string (binary serialization is trivial, by just copying the limbs)
(header-based) ctbignum is available in Matt Godbolt's Compiler Explorer! Play around with ctbignum's API, and see the assembly code it gets compiles down to, for the compiler of your choice..!
This is a C++20 module-based library. Installation requires a compiler that supports C++20 modules and support for importing the standard library as modules. CMake is recommended for building the library and running the benchmarks.
- newer: C++23 compliant compiler (
import std;)
- C++ Standard library
- NTL (Victor Shoup's number theory library), version 10.5.0 or newer.
SCIPR lab's libff(currently not used in modularized version)GMP(libff dependency)- Google Benchmark
import lam::cbn;
// Initialization via (user-defined) literal
// (with automatic deduction of number of limbs)
using namespace lam::cbn::literals;
constexpr auto number = lam::cbn::to_big_int(6513020836420374401749667047018991798096360820_Z);
constexpr lam::cbn::big_int<3> expected_result = {1315566964, 326042948, 19140048};
static_assert(number == expected_result, "initialization failure");(See unit tests for more examples.)
-
Presentation at CPPCon 2018 (slides, pdf, 1.7 MB)
Or, watch the video:
If you would like to mention our library in your academic publication, then please cite the following work: Multiprecision Arithmetic for Cryptology in C++ - Compile-Time Computations and Beating the Performance of Hand-Optimized Assembly at Run-Time, Niek J. Bouman, 2018
@misc{Bouman2018,
author = {Bouman, Niek J.},
title = {Multiprecision Arithmetic for Cryptology in C++ - Compile-Time Computations and Beating the Performance of Hand-Optimized Assembly at Run-Time},
howpublished = {arXiv:1804.07236},
year = {2018},
note = {\url{https://arxiv.org/abs/1804.07236}},
}
This modularized version of ctbignum is a fork of the original ctbignum library by Niek J. Bouman. The original library is header-only, and is available here.
To run the tests in a docker image using .gitlab-ci.yml:
- Get gitlab-runner
- Run
gitlab-runner exec docker buildfrom the project root directory
