Skip to main content
Cryptography

Return to Question

Tweeted twitter.com/StackCrypto/status/1327989756299456515
Became Hot Network Question
typos
Source Link
kelalaka
kelalaka
  • 49.5k
  • 12
  • 118
  • 205

The only time a shift cipher considers to be perfectly secure, is when used on a single letter of plaintext and no more. Having that in mind, we can say it is certainly not perfectly secure.

CeasarCaesar cipher is perfectly secret only in the special case with the assumption that 26 keys are used in equal probability. Suppose that we have a plaintext of 50 characters long, if each key for each character is chosen equiprobably then you end with 26^50 possible keys.

That is my answer, is it correct?

The only time a shift cipher considers to be perfectly secure, is when used on a single letter of plaintext and no more. Having that in mind, we can say it is certainly not perfectly secure.

Ceasar cipher is perfectly secret only in the special case with the assumption that 26 keys are used in equal probability. Suppose that we have a plaintext of 50 characters long, if each key for each character is chosen equiprobably then you end with 26^50 possible keys.

That is my answer, is it correct?

The only time a shift cipher considers to be perfectly secure is when used on a single letter of plaintext and no more. Having that in mind, we can say it is certainly not perfectly secure.

Caesar cipher is perfectly secret only in the special case with the assumption that 26 keys are used in equal probability. Suppose that we have a plaintext of 50 characters long if each key for each character is chosen equiprobably then you end with 26^50 possible keys.

That is my answer, is it correct?

Source Link
whitehat.c
whitehat.c
  • 63
  • 1
  • 5

Is Caesar cipher perfectly secret?

The only time a shift cipher considers to be perfectly secure, is when used on a single letter of plaintext and no more. Having that in mind, we can say it is certainly not perfectly secure.

Ceasar cipher is perfectly secret only in the special case with the assumption that 26 keys are used in equal probability. Suppose that we have a plaintext of 50 characters long, if each key for each character is chosen equiprobably then you end with 26^50 possible keys.

That is my answer, is it correct?