network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 3 months |
| seen | May 10 at 12:49 | |
| stats | profile views | 0 |
|
Apr 28 |
asked | standard way to authenticate parties with public keys without certificates |
|
Feb 20 |
awarded | Scholar |
|
Feb 20 |
accepted | AES key/ciphertext space sizes |
|
Feb 20 |
comment |
AES key/ciphertext space sizes Many thanks for your answer! I have to think more about it, but if it is OK to assume that if I have only one ciphertext block it is possible to have different encryption keys that could decrypt this single block (mapping P1 -> C1 can be the same for many permutations) then what is the minimum size of ciphertext I need to have to be sure what key was used for encryption (theoretically - assume I can wait for the search of the whole key space)-is there general rule for that? How is it called? And is there minimum size of ciphertext which ensures that the permutation was identified correctly? |
|
Feb 19 |
awarded | Student |
|
Feb 19 |
asked | AES key/ciphertext space sizes |
