-
The addition operation in projective coordinates implements operator overloading that computes a scalar multiplication using a naive double-and-add algorithm. Would be worth specializing the operation…
-
Migrate [math](https://github.com/starkware-libs/stone-prover/tree/main/src/starkware/math).
Relatively self-contained, only about 300 lines of code.
-
Are there any future plans to add integer modulo n?
I mean features such as multiplicative/additive inverses modulo n, order a modulo n, primitive roots modulo n, quadratic residues etc.
-
The goal of this issue is to provide a guideline on how to fix https://github.com/status-im/nimbus-eth1/issues/1584.
Also pinging @treeform, @guzba on how to implement fast RSA (modexp is the bottl…
-
## Description
For v0.19.3 (latest), source code for the _local_binary_pattern function within _texture.pyx appears to have an error when calculating the number of sign changes between patterns. This…
-
## Brief
Currently, CryptID.native uses affine points which can lead to suboptimal performance in some cases. To speed up things, we should consider implementing other point representations.
## …
-
# Bug report
When comparing two time instances with different timezone, there are some unexpected result in some cases.
```python
from datetime import datetime, time, timezone, timedelta
# T…
-
Might be quite useful to link `Bip`/`Bin`/`Biz` to un/signed machine words, perhaps by making a covering function for `Data.Bits`.
-
### Triton python code
```mlir
def triton_(in_out_ptr0, in_ptr0, in_ptr1, in_ptr2, in_ptr3, in_ptr4, in_ptr5, out_ptr2, xnumel, rnumel):
xnumel = 16384
XBLOCK: tl.constexpr = 1
rnumel …
-
## Summary
RSA (Rivest-Shamir-Adleman) remains one of the most widely recognized and utilized asymmetric cryptographic algorithms, despite the emergence of more advanced schemes like ECDSA, EdDSA, …