-
Hi @jpcima
Hope all is well
One of our users suggested that we add an emsemble chorus to Surge and another pointed at this code. Would you be OK if we used some of this code directly and indire…
-
We have been using the Fiat Crypto framework for developing verified and efficient implementations of quadratic field extensions to be used for curves such as FourQ and BLS-12.
The project can be f…
-
It would be nice to be able to verify that our Go code works. I'm not sure where to find Go tests, though. cc @andres-erbsen
-
The current fastest known (non-vectorized) implementations of curve25519 use 4 limbs, and IIRC do arithmetic modulo `2^256-38`. Could we generate C code that does that? When compiled with a convention…
-
Word-by-word square could run faster than multiplication, in that we can save some word-size multiplications due to the symmetry: multiplying field elements with 4 limbs requires 16 multiplications: a…
-
**Käsitteen tyyppi**
CONCEPT
**Ehdotettu termi suomeksi**
kuunnelmat (käsikirjoitukset)
**Ehdotettu termi ruotsiksi**
hörspel (manuskript)
**Ehdotettu termi englanniksi**
radio plays
**Tarko…
-
1. **Ask**: List files for download
2. **Grab**: Download selected files
3. **Peek**: Inspect downloaded zips for selection
4. **Prune**: Choose files to unzip
5. **Peel**: Unzip chosen files
…
-
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…
-
This is a tracking issue for additional elliptic curves we could potentially implement.
Note that we are presently focusing on short Weierstrass curves which can be implemented using the `primeorde…
-
There are a lot of Z.combine_at_bitwidth operations left over. Not sure why, I'll try to dig into this.