-
Hi, I really quite enjoy working with your library, great work there!
Would it be possible to also implement efficient modular exponentiation (i.e. `modPow(b, e, modulus) = (b ** e) % modulus`) in …
-
We'll emulate these with slower e operations for now. Rotation is not as important as modular numbers or exponentiation, but nice to have for crypto.
-
Since we switched to a new calling convention (c915e5f7161fef07f1683f9871f0c536156148f7) for RSA on OTBN, now is a good time to also include a blinded version of modular exponentiation.
-
Hello,
I found the bug in `ippsMontExp` when base and mod is about 3000bit.
I follow the way of [Developer Reference](https://www.intel.com/content/www/us/en/docs/ipp-crypto/developer-reference/…
udoya updated
10 months ago
-
WDYT? Is this publication in scope?
```
@inproceedings{Joye_2008,
author = {Joye, Marc},
booktitle = {2008 5th Workshop on Fault Diagnosis and Tolerance in Cryptography},
doi = {10.1109/fdtc.2008.8…
aewag updated
3 weeks ago
-
Rasied by Trinity Tonic in the [support forum](https://tls.mbed.org/discussions/crypto-and-ssl/dealing-with-negative-mpis-inside-bignum-c):
>I've been replacing the modular exponentiation function in…
-
## Issue Description
We're looking to enhance the functionality of PyDS-A by adding more methods to our existing algorithms. This will provide users with a more comprehensive toolkit for solving va…
-
### Binary Exponentiation
- Integer version
- Matrix version
- Implementation
- Examples
### Sieve of Eratosthenes
- Finding Prime Numbers
- Implementation
- Examples
### Sieve of Euler
- Ye…
-
Hi,
I am trying to use the RSA module to do some signature verification, and I found that the byte order of `TLbBigInt` to be kind of funny.
If I do this to load `pubkey.der` which was generate…
-
Currently the contract only supports 256 bit types. In the wild, this library would have to be updated to handle much larger primes. Possible implementation could use the [zcoin BigNumber](https://git…
10d9e updated
9 months ago