Big Integer Design
https://bearssl.org/bigint.html [bearssl.org]
2019-02-03 20:08
This page explains the design and implementation of operations on big (modular) integers, used for RSA and generic elliptic curve computations.
This section describes the mathematical foundations of the algorithms implemented in BearSSL. This is in no way an exhaustive treaty of computations on big integers; there are many representations and algorithms that are not shown here. These algorithms are the ones that are used in BearSSL (except Karatsuba multiplication, which is briefly exposed below, but not used in BearSSL right now).