-
## 📋 General Issue or Question
### Issue Description
The **Discrete Logarithm** problem is the reverse of the modular exponentiation problem. Given integers \( a \), \( b \), and \( p \), the disc…
-
If you encrypt files on a machine with tons of RAM and cores, age isn't any faster versus some basic slow PC.
I think it would be great to utilize resources when they're available.
Tried this on…
-
Currently you have to either store the password in plain text on a config file, which is almost the same as having no password at all, or type it every time you log in, which is annoying and easy to f…
-
As pointed by Paul Zimmerman in [#11802 comment:16](https://github.com/sagemath/sage/issues/11802#comment:16), the Lucas sequence which has been finally sped up and generalized in #11802, needs seri…
-
Vast majority of computation cost lies in ge_add. mkp uses same technique as horse, that is adding 8-multiplies to a work public point, and bumping the secret scalar by 8 in lockstep.
One step cost…
-
All integers in Fortran are signed. It is a common request to include unsigned integers. At the very least to help with the interoperation with the C API that uses unsigned integers.
The best appro…
-
Are botan and libasync stable enough to be used as default in vibe.d over openssl and libevent? Base on some of my previous code ive written in D that i recently compiled, it looks like libevent and o…
-
"widely binarily delicate prime"?
I think we can cover the high bits by only considering numbers that have particular values modulo 3, 5, 7, 13, 17, and 241 and have particular floor(log base 2) valu…
-
### Describe the feature you'd like
This is a follow-on from #6335, and relates to prior requests in #4168 and [here](https://github.com/IntersectMBO/plutus/pull/4733#issuecomment-2039713074), as wel…
-
### Problem statement
The DHM API allows callers to request a maximum size `x_size` for the Diffie-Hellman secret, expressed in bytes. This is misleading and dangerous. This was not tested until ht…