Timeline for Does having the discrete logarithm of prime factors of $n$ allow us to calculate any discrete log more efficiently?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 2, 2022 at 21:32 | answer | added | Ben Smith | timeline score: 3 | |
| Dec 24, 2021 at 18:41 | vote | accept | Matt Groff | ||
| Dec 23, 2021 at 21:38 | answer | added | Jonathan Love | timeline score: 2 | |
| Dec 23, 2021 at 18:58 | comment | added | Matt Groff | @GerryMyerson: I'm really interested in the generalized problem, not specific to any base. Thanks for pointing that out! | |
| Dec 23, 2021 at 18:56 | history | edited | Matt Groff | CC BY-SA 4.0 |
Added that we're interested in the general case.
|
| Dec 23, 2021 at 18:52 | comment | added | Gerry Myerson | "Discrete log" is relative to a base, but I don't see any mention of a base in your question. | |
| Dec 23, 2021 at 15:28 | comment | added | Matt Groff | @Wojowu: Edited this, too. Thank you for your help! | |
| Dec 23, 2021 at 15:26 | history | edited | Matt Groff | CC BY-SA 4.0 |
Edited that we have the prime factorization of Euler's totient of $n$.
|
| Dec 23, 2021 at 15:17 | comment | added | Wojowu | The order of an element of $\mathbb Z_n^\times$ is a divisior not of $n$, but of $|\mathbb Z_n^\times|=\varphi(n)$. So usually there won't be elements of order $p_x^{k_x}$. | |
| Dec 23, 2021 at 15:11 | comment | added | Matt Groff | @Wojowu: Sorry, I edited the question to say that we have values of order $(p_x)^{k_x}$, etc. | |
| Dec 23, 2021 at 15:10 | history | edited | Matt Groff | CC BY-SA 4.0 |
Edited the values that we have.
|
| Dec 23, 2021 at 15:07 | comment | added | Wojowu | What do you mean with $e^{2\pi i/p}\pmod n$? $e^{2\pi i/p}$ is a complex number, usually modulo is only considered with integers. | |
| Dec 23, 2021 at 15:01 | history | asked | Matt Groff | CC BY-SA 4.0 |