-
Currently, most of the time in the signing protocol is spent in Montgomery exponentiation. Key refresh is split between exponentiation and prime number generation, but the latter is mainly exponentiat…
-
### Context
Scalars in EC modules are both used in point operations as scalars and modular operations modulo the group order. The original approach was to represent them as an `mpi_mod_residue`. Th…
-
I ran
```
./src/ExtractionOCaml/word_by_word_montgomery pasta_fp 64 '2^254 + 45560315531419706090280762371685220353' --no-wide-int
```
and got output containing the function
```c
/*
* The f…
-
WDYT? Is this publication in scope?
```
@inproceedings{Fouque_2008,
author = {Fouque, Pierre-Alain and Lercier, Reynald and Réal, Denis and Valette, Frédéric},
booktitle = {2008 5th Workshop on Faul…
aewag updated
2 weeks ago
-
In Sage, matrix arithmetic over finite fields is fast in the following cases:
* Prime fields, using linbox (#4260) resp. `M4RI` over `GF(2)`
* `GF(2^e)`, using `M4RIE` (#9562)
In all other cases, …
-
In order to support more elaborate optimizations for the underlying multi-precision arithmetic, it might help to introduce a simpler "generic assembly" precisely for this purpose. Rather than manipula…
-
Howdy Folks,
So I have this [ECCKiila branch here](https://gitlab.com/nisec/ecckiila/-/tree/bbb_inv) utilizing the `divstep` functionality for GF inversion. Everything works after tweaking some con…
-
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…
-
This issue tracks the progress on https://github.com/privacy-scaling-explorations/halo2/issues/187
##### Original text
> [ ] (optional +10% perf) implement extended Jacobian coordinates. Their m…
-
I am developing a program using arkworks' groth16 snark library.
Proof verification benchmark performance results were sufficiently fast in the local development environment, but very slow performanc…