Timeline for How to generate safe primes in a verifiable way?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 7, 2021 at 7:59 | history | edited | CommunityBot |
replaced https://tools.ietf.org/html/rfc with https://www.rfc-editor.org/rfc/rfc
|
|
| Feb 26, 2018 at 0:44 | history | edited | Squeamish Ossifrage | CC BY-SA 3.0 |
Complete a heartbreaking work of underscored genius.
|
| Feb 22, 2018 at 15:26 | history | edited | Squeamish Ossifrage | CC BY-SA 3.0 |
Subject and verb got in a frank exchange of opinion over plurality.
|
| Feb 19, 2018 at 1:48 | history | edited | Squeamish Ossifrage | CC BY-SA 3.0 |
Answer about Elgamal encryption.
|
| Feb 17, 2018 at 23:37 | comment | added | Maarten Bodewes♦ | Note that the comment of fgrieu has been removed. There is a comment of the original author where El Gamal encryption is indicated as reason for the larger parameters. You can indeed to El Gamal encryption with OAEP padding, but as you might imagine, the overhead of OAEP won't let you encrypt that much data and without parameters you may need to change OAEP if you don't (hint). | |
| Feb 16, 2018 at 18:29 | history | edited | Squeamish Ossifrage | CC BY-SA 3.0 |
Clarify that we are, in fact, searching for safe primes, not primes in general, and generators of prime-order subgroups, not the whole group.
|
| Feb 16, 2018 at 16:51 | history | edited | Squeamish Ossifrage | CC BY-SA 3.0 |
Suggest a better alternative for DH.
|
| Feb 16, 2018 at 16:37 | history | answered | Squeamish Ossifrage | CC BY-SA 3.0 |