Timeline for Why do polynomials $x^n + 1 \bmod N$ close a shorter cycle when $n$ is even than when $n$ is odd?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 3, 2019 at 4:36 | history | edited | kodlu | CC BY-SA 4.0 |
added 9 characters in body
|
| Mar 3, 2019 at 0:43 | comment | added | user136217 | Given this marvelous paper, the question I still have is whether what applies to polynomials $g(x) = x^e \bmod N$ also applies to $f(x) = x^e + 1 \bmod N$, where $\gcd(e, \lambda(N)) = 1$. The paper's results seems directed at $g(x)$ and not $f(x)$. | |
| Mar 3, 2019 at 0:30 | comment | added | user136217 | You must have meant $\gcd(e, \lambda(N)) = 1$ because that's what the paper says on page 1592, 5th paragraph. | |
| Mar 3, 2019 at 0:23 | vote | accept | user136217 | ||
| Mar 2, 2019 at 12:58 | vote | accept | user136217 | ||
| Mar 3, 2019 at 0:23 | |||||
| Feb 24, 2019 at 22:04 | history | answered | kodlu | CC BY-SA 4.0 |