-
As mentioned in #169, it doesn't matter whether our EC math (or operations building on it) are constant time if the underlying modular arithmetic is not constant time.
Investigate whether the under…
-
I wanted to come up with a better implementation for primality. Basic modular arithmetic should probably be tackled first but they might go hand in hand.
-
Here is a simple function (bernsum_powg) taken from David Harvey's bernmm library (using NTL), and two FLINT versions using the n_precomp and n_preinvert interfaces.
```
#include
#include "flint…
-
Hello,
Modular arithmetic being a common mathematical and computational concept, would it make sense to add support for it to this library?
I was thinking that implementing traits such as
``` rust
…
-
I'm working on a Rust implementation of Paillier cryptosystem (https://github.com/kunerd/rpaillier). After I started I realised a lag of fundamental big number arithmetic functions like `mod_pow` and …
-
The calculator does not give accurate results while calculating large powers of a number. E.g., the calculator approximates when calculating 9 ^ 30. This is reasonable. But this problem carries over t…
-
# How to build a modular arithmetic library in Python
In this tutorial, we're going to learn how to create a library for modular arithmetic, using operator overloading and redefining the built-in fun…
-
For several purposes it would be great for the Boost.Multiprecision to have a modular arithmetics adaptor.
Does it have any chance to be merged?
-
Modular arithmetics is required for the further extension of library applicability.
-
# Problem
Montgomery multiplication is a critical operation in multi-scalar multiplication (MSM) that significantly impacts performance. The current implementation lacks an optimized Montgomery multi…