-
https://github.com/jtobey/javascript-bignum/blob/master/lib/leemonBigInt.js#L903
I've been trying to implement Pollard's Rho algorithm as part of a demonstration of ElGamal. While testing it, I deter…
-
We need to run the command as follow:
`./pollardsrho `
Example:
`./pollardsrho 03633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852 130 1000000`
About public key, ok. We ne…
-
Unless I'm missing something, it seems SymPy doesn't offer any way to compute discrete logarithms (i.e. generalized multiplicative order), only the multiplicative order.
For instance, Mathematica doe…
-
# Chi tiết bài tập - Luyện Code Online
[https://luyencode.net/problem/PTICH](https://luyencode.net/problem/PTICH)
-
Hello
Is it possible to add a compressed and uncompressed pub key search i think it will increase also the speed.
Set up Brute Force to search only the "X" value from the Pub Key or both "X" an…
-
## Graph
- [x] Graph
- [x] Dijkstra
- [x] Floyd (with traceback)
- [ ] Bellman-Ford
- [ ] Dinic
- [ ] MCMF
- [ ] Hungarian
- [ ] Push-relabel
- [ ] SCC
- [ ] BCC
- [ ] 2-SAT
- [ ] Dual Gra…
-
This is more of a curiosity than an actual issue, so feel free to close this if it doesn't seem relevant.
I was inspired by the nice talk you (@chiphogg ) gave at CppCon to implement vector space ma…
-
I was delighted to find sympy has a built-in `divisor_sigma` function as I had previously been using the following (which still uses sympy's `factorint`):
```python
from sympy.ntheory import divis…
-
See https://www.johndcook.com/blog/2019/03/14/irreducible-polynomials/. He has to use `sum(...)//n` instead of `sum(...)/n` because the computation produces floats. But if `divisors` returned `Integer…
-
This addition of Msieve will hopefully enhance Sage's Integer Factorization ability for all integers of a reasonable size, and provide the opportunity for users to utilize the Number Field Sieve.
h…