-
We need to expose basic arithmetic over finite fields and common operations on EC points in our API.
This is required to implement PAKEs and threshold signatures among things that the module doesn’…
-
I haven't been able to find functions relating to libsodiums [Finite Field arithmetic](https://doc.libsodium.org/advanced/point-arithmetic#scalar-multiplication). If they're available how do I invoke …
-
Under the hood, snarkyjs depends on a [Rust code base](https://github.com/o1-labs/proof-systems) which is based on arkworks for finite field and elliptic curve implementations. These are fairly slow w…
-
ie when using smt or sage to find a solution that passes some manual oracle produce the witness.json file automatically
-
As far as I understand, the focus of this project is ECC, even though other uses of finite field arithmetic are supported (Poly1305). Is it easily possible to support finite fields large enough that D…
-
I would like to use the scipr-lab library [libfqfft](https://github.com/scipr-lab/libfqfft) for a project that needs to do interpolation and evaluation of polynomials whose coefficients are in GF(2^16…
-
[fiat-crypto](https://github.com/mit-plv/fiat-crypto) could be used to generate known constant-time and correct finite-field arithmetic for selected primes which could the be used in the codegen subpa…
-
The dependency on [HaskellForMaths](https://hackage.haskell.org/package/HaskellForMaths) turned out to be not a wise choice. Even though it provides an implementation of field extensions (finite fiel…
-
Currently we have a lot of isolated profiling and example programs, but no automatic way to aggregate performance benchmarks. A unified benchmark suite would be useful to catch performance regressions…
-
The general note section called "Why Fields are Prime" is problematic.
1. The title, "Why Fields are Prime", is incorrect, as a field's order may be a prime power with power greater than 1. This …