Timeline for How safe is a prime with $P=2 \cdot Q \cdot R \cdot S \cdot t+1$ for discrete logarithm? How to enhance/compare?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 12, 2019 at 13:32 | history | edited | J. Doe | CC BY-SA 4.0 |
added 9 characters in body
|
| May 7, 2019 at 22:57 | history | edited | J. Doe | CC BY-SA 4.0 |
added 57 characters in body
|
| May 7, 2019 at 22:46 | history | edited | J. Doe | CC BY-SA 4.0 |
added 150 characters in body
|
| May 6, 2019 at 10:11 | history | edited | J. Doe | CC BY-SA 4.0 |
added 119 characters in body
|
| May 5, 2019 at 21:33 | comment | added | J. Doe | It's only a partly answer. Only an upper border. Did some edit. | |
| May 5, 2019 at 21:33 | vote | accept | J. Doe | ||
| May 5, 2019 at 21:33 | history | edited | J. Doe | CC BY-SA 4.0 |
added 406 characters in body
|
| May 5, 2019 at 20:09 | comment | added | Ella Rose | Good job on answering your own question! But please remember that stackexchange is a question and answer site, rather than a forum. Replies to questions are required to be an answer to the question, and including more questions in an answer is not how our site works. You can ask a new question and point back to this Q/A as context for the new question(s). | |
| May 5, 2019 at 19:37 | history | answered | J. Doe | CC BY-SA 4.0 |