Givaro
|
The recint-based Montgomery ring. More...
#include <montgomery-ruint.h>
Inherits FiniteFieldInterface< _Element >.
The recint-based Montgomery ring.
You can only odd moduli. An integer (a mod p) is stored as (a * r mod 2^{2^K}) with (r = 2^{2^K} mod p).