network profile
| bio | website | |
|---|---|---|
| location | Germany | |
| age | ||
| visits | member for | 11 months |
| seen | Jul 1 '12 at 20:07 | |
| stats | profile views | 2 |
|
Jul 1 |
comment |
How to decrypt this RSA-like cipher i am not really going to use this, it's just an exercise from an old crypto class, and i am trying to prepare for the exam ;-). Thanks a lot for your answer, this made a lot of things clearer! |
|
Jul 1 |
accepted | How to decrypt this RSA-like cipher |
|
Jul 1 |
revised |
How to decrypt this RSA-like cipher edited body |
|
Jul 1 |
asked | How to decrypt this RSA-like cipher |
|
Jun 30 |
awarded | Scholar |
|
Jun 30 |
accepted | Using bad generator in ElGamal Encryption |
|
Jun 30 |
comment |
Using bad generator in ElGamal Encryption Isn't finding such a $q$ with $g^q \equiv 1 \pmod{p}$ equivalent to solving the discrete logarithm problem? |
|
Jun 29 |
awarded | Supporter |
|
Jun 29 |
comment |
Using bad generator in ElGamal Encryption interesting, i didn't know that. but what happens when $g$ isn't a valid generator at all? |
|
Jun 29 |
revised |
Using bad generator in ElGamal Encryption added 10 characters in body |
|
Jun 29 |
revised |
Using bad generator in ElGamal Encryption better formatting |
|
Jun 29 |
revised |
Using bad generator in ElGamal Encryption better formatting |
|
Jun 29 |
awarded | Student |
|
Jun 29 |
awarded | Editor |
|
Jun 29 |
revised |
Using bad generator in ElGamal Encryption added 277 characters in body |
|
Jun 29 |
awarded | Autobiographer |
|
Jun 29 |
asked | Using bad generator in ElGamal Encryption |
