Hey everyone
I found something interesting while messing with some polynomials and automorphisms. So, there’s this S₃ Perfect-Square Discriminant. If you do x2 = β * x1 (where β³ = 1 when j = 0), the discriminant for the S₃ polynomial in z turns out to be Δ = 16 * (x₁³ + b)² (mod p).
Does anyone know if this is linked to algorithms like Pollard Rho? I just started learning cryptography and I could use some help.
Interesting point. You can cube x and get a value that represents P, P*lamba, P*lambda^2. This basically triples the effective table size. But the speedup only matters if a point’s equally likely to be in one of those groups. For secp256k1, DLP solving usually occurs in a limited range, right? The whole group is huge, so chances are slim unless x is within a small range. It's a real thing in some cases, but also tons of pointless challenges.
That's a fortunate case. I asked it to count 1 to 100 and it skipped 6. It also repeated lots of numbers and skipped random gaps after them, so that must be a clue to the secrets of the multiverse.
So what I get, is that 6 does not exist, and arithmetic as we know it is wrong, ok?
Though I don't see how this would be an issue for most people that ask it to break crypto.