-
Now that we have benchmarks for EVMMAX precompiles we can experiment with different Montgomery multiplication algorithms. Currently we use [CIOS](https://github.com/ethereum/evmone/blob/v0.11.0/lib/ev…
-
Our attempts at formal verification of the montgomery_reduce() function in ref/reduce.c reveal that this function depends on a subtle implementation-defined behaviour - namely a cast from int32_t to i…
-
## Description
Please provide a clear and concise description of the feature you would like included.
## Motivation
Please provide a clear and concise description of the motivation for adding…
-
Summary of request: Modify the information in an existing ROR record
Name of organization: Fulton–Montgomery Community College
ROR ID: https://ror.org/01cmkbc96
Which part of the record needs to …
-
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…
-
In ecp.h, for the nbits:
size_t nbits; /*!< For Short Weierstrass: The number of bits in \p P.
For Montgomery curves: the number of bits in the
…
-
Default ClangCl release config produces following bench result for 64 bits:
```
Null (baseline): 0.931991ns
Naive: 9.23445n…
-
Implement the more efficient CIOS algorithm from Gnark.
Bench with the finite field benches and confirm if there are improvements
https://hackmd.io/@gnark/modular_multiplication
-
See blogpost here: https://jeffhurchalla.com/2022/04/28/montgomery-redc-using-the-positive-inverse-mod-r/
-