Caesar Cipher is an example of(a) Poly-alphabetic Cipher(b) Mono-alpha – InterviewSolution

1.	Caesar Cipher is an example of(a) Poly-alphabetic Cipher(b) Mono-alphabetic Cipher(c) Multi-alphabetic Cipher(d) Bi-alphabetic Cipher
Answer» Right answer is (b) Mono-alphabetic Cipher Easy explanation: Caesar Cipher is an example of Mono-alphabetic cipher, as single alphabets are encrypted or decrypted at a time.

Discussion

No Comment Found

Related InterviewSolutions

In base 26, multiplication of YES by NO gives -(a) THWOE(b) MPAHT(c) MPJNS(d) THWAE
Dividing (11001001) by (100111) gives remainder -(a) 11(b) 111(c) 101(d) 110
The Index of Coincidence for English language is approximately(a) 0.068(b) 0.038(c) 0.065(d) 0.048
If all letters have the same chance of being chosen, the IC is approximately(a) 0.065(b) 0.035(c) 0.048(d) 0.038
Reduce the following big-O natations:O[ en + an10] =(a) O[ an^10 ](b) O[ n^10 ].(c) O[ e^n ].(d) O[ e^n + n^10 ].
Reduce the following big-O natations:O[ ax7 + 3 x3 + sin(x)] =(a) O[ax^7](b) O[sin(x)].(c) O[x^7].(d) O[x^7 + x^3].
Divide (HAPPY)26 by (SAD)26. We get quotient -(a) KD(b) LD(c) JC(d) MC
Division of (131B6C3) base 16 by (lA2F) base 16 yeilds -(a) 1AD(b) DAD(c) BAD(d) 9AD
The estimated computations required to crack a password of 6 characters from the 26 letter alphabet is-(a) 308915776(b) 11881376(c) 456976(d) 8031810176
The time required to convert a k-bit integer to its representation in the base 10 in terms of big-O notation is(a) O(log2 n)(b) O(log n)(c) O(log2 2n)(d) O(2log n)