-
WDYT? Is this publication in scope?
```
@inbook{Homma,
author = {Homma, Naofumi and Miyamoto, Atsushi and Aoki, Takafumi and Satoh, Akashi and Shamir, Adi},
booktitle = {Cryptographic Hardware and E…
-
Introduce modular exponentiation in poly similar to `pow(base, exp, mod)`
-
WDYT? Is this publication in scope?
```
@article{Diop_2018,
author = {Diop, Ibrahima and Linge, Yanis and Ordas, Thomas and Liardet, Pierre-Yvan and Maurine, Philippe},
doi = {10.1007/s13389-018-018…
-
Example:
```python
import galois
p = 2**127 - 1
coefs = [132937, -281708, 210865, -132177, 154492, -119403, 64244, -21729, 12062, -425, 325, 525, 110, 20, 4, 1, 1]
Fp = galois.GF(p)
poly = gal…
-
It would be nice for curbing expression swell if high powers `RootOf` objects were reduced according to their minimal polynomial, like below:
``` python
import sympy
from sympy.abc import y
f = 3*y*…
-
We have the `` component, which calls the [mod](https://mathjs.org/docs/reference/functions/mod.html) command from math.js. In DoenetML,
`8 3`
is mapped (I presume?) to `math.mod(8,3)` in math…
-
Fast Modular Exponentiation is a high-performance technique used in computer science and cryptography to swiftly compute massive modular exponentiations. It is especially handy when working with big n…
-
```
sage: x = polygen(ZZ)
sage: pow(x,100,x+1)
x^100
```
CC: @roed314 @jdemeyer @pjbruin @sagetrac-jakobkroeker
Component: **algebra**
Stopgaps: **wrongAnswerMarker**
Author: **Shashwat Singh*…
-
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 …
-
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…