Timeline for Is a transposition cipher categorized as asymmetric algorithm?
Current License: CC BY-SA 4.0
14 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 10, 2018 at 21:38 | history | edited | Anders | CC BY-SA 4.0 |
deleted 65 characters in body
|
Jan 18, 2017 at 20:50 | comment | added | CodesInChaos | @GreenPenguin Depends on how you choose the public key (small fixed values are common) and on how you define the private key (private exponent vs knowledge of the prime factors). And for typical Discrete logarithm based crypto you compute the public key by multiplying the private key with the generator. | |
Jan 18, 2017 at 18:29 | comment | added | GreenPenguin | @CodesInChaos What if I know the public key, can I compute the private key? I think in RSA, the choice of public key and private key can be interchanged, right? | |
Jan 18, 2017 at 17:52 | vote | accept | GreenPenguin | ||
Jan 18, 2017 at 17:51 | vote | accept | GreenPenguin | ||
Jan 18, 2017 at 17:51 | |||||
Jan 18, 2017 at 17:51 | vote | accept | GreenPenguin | ||
Jan 18, 2017 at 17:51 | |||||
Jan 18, 2017 at 17:51 | vote | accept | GreenPenguin | ||
Jan 18, 2017 at 17:51 | |||||
Jan 18, 2017 at 17:51 | vote | accept | GreenPenguin | ||
Jan 18, 2017 at 17:51 | |||||
Jan 18, 2017 at 17:51 | vote | accept | GreenPenguin | ||
Jan 18, 2017 at 17:51 | |||||
Jan 17, 2017 at 7:32 | comment | added | CodesInChaos | "and someone who only knows the private key can not encrypt them. " that's not true in general. You typivally can compute the public key from the private key. | |
Jan 16, 2017 at 23:30 | history | migrated | from security.stackexchange.com (revisions) | ||
Jan 16, 2017 at 21:53 | comment | added | Limit | @GreenPenguin if you find the answer to be correct, can you please mark it as accepted? | |
Jan 16, 2017 at 18:53 | comment | added | GreenPenguin | Nice explanation, these definitions are far more accurate than those written in many books. :) | |
Jan 16, 2017 at 18:32 | history | answered | Anders | CC BY-SA 3.0 |