Timeline for How to generate safe primes in a verifiable way?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 19, 2018 at 15:21 | comment | added | adarim | I am trying to find a method similar to that proposed in FIPS 186-3 but for p 2048 and q 2047. I mean, generate prime numbers using a seed and a counter and provide these parameters to the validation method. Maybe I'm missing some important detail and this cannot be done for these values of p and q, or there is just a simpler method without seed or _counter. It is just an exercise. | |
| Feb 19, 2018 at 11:42 | comment | added | CodesInChaos | What do you need? A nothing up my sleeve number? A deterministic primality proof? | |
| Feb 19, 2018 at 1:54 | comment | added | Maeher | What exactly is it that you want to verify? That it is a safe prime of the appropriate length? In that case just check that it has the correct length, that it's prime and that $(p-1)/2$ is also prime. Seems trivially checkable. | |
| Feb 17, 2018 at 23:34 | comment | added | Maarten Bodewes♦ | Interesting, but I wonder if there would still be any performance benefits over normal DSA. Would it be faster do you think or is this just an exercise? I think generating the parameters might take very long, but I don't think that would be a big issue of course. | |
| Feb 17, 2018 at 11:53 | comment | added | adarim | I am using ElGamal encryption and I was wondering how to demonstrate that I have chosen parameters appropriately. | |
| Feb 16, 2018 at 16:37 | answer | added | Squeamish Ossifrage | timeline score: 7 | |
| Feb 16, 2018 at 16:30 | comment | added | mikeazo | Why do you want to do this? | |
| Feb 16, 2018 at 16:18 | review | First posts | |||
| Feb 17, 2018 at 3:37 | |||||
| Feb 16, 2018 at 16:16 | history | asked | adarim | CC BY-SA 3.0 |