In which of the following cipher the plain text and the ciphered text does not have same number of letters?(a) affine cipher(b) autokey cipher(c) columnar cipher(d) additive cipherI had been asked this question during an interview.Origin of the question is Cryptography in division Cryptography of Data Structures & Algorithms II

In which of the following cipher the plain text and the ciphered text

1.	In which of the following cipher the plain text and the ciphered text does not have same number of letters?(a) affine cipher(b) autokey cipher(c) columnar cipher(d) additive cipherI had been asked this question during an interview.Origin of the question is Cryptography in division Cryptography of Data Structures & Algorithms II
Answer» The CORRECT answer is (B) AUTOKEY cipher Easy EXPLANATION - In transposition cipher and mono alphabetic cipher the number of letters remain same in ciphered and deciphered text. But in poly alphabetic cipher the number of letters are different. So here as autokey cipher is the only poly alphabetic cipher so it will be the answer.

Discussion

No Comment Found

Related InterviewSolutions

While choosing the value of a and m (m is the no. of alphabets) in affine cipher it must be ensured that?(a) a and m are prime numbers(b) a and m are odd numbers(c) a and m are coprime(d) a and m are even numbersThis question was posed to me during an interview.The question is from Cryptography topic in section Cryptography of Data Structures & Algorithms II
What will be the plain text corresponding to ciphered text “rmw ” if an affine cipher is used with key values as a=5, b=10?(a) csk(b) kkr(c) srt(d) msdThis question was posed to me during an interview for a job.Question is taken from Cryptography topic in division Cryptography of Data Structures & Algorithms II
What will be the ciphered text corresponding to plain text “sanfoundry” if an affine cipher is used with key values as a=5, b=10?(a) wkxjcgxzra(b) gkxteuxfzw(c) ukxhmyxdfg(d) rfsexbsumvThe question was posed to me in homework.My question is from Cryptography topic in portion Cryptography of Data Structures & Algorithms II
Affine cipher is not susceptible to frequency analysis.(a) true(b) falseThe question was posed to me during a job interview.Origin of the question is Cryptography topic in chapter Cryptography of Data Structures & Algorithms II
Affine cipher is less secure than caesar cipher.(a) true(b) falseI got this question during an interview.My question is taken from Cryptography topic in portion Cryptography of Data Structures & Algorithms II
Affine cipher is an example of?(a) Mono alphabetic cipher(b) Poly alphabetic cipher(c) Transposition cipher(d) Asymmetric cipherI got this question in class test.My query is from Cryptography topic in division Cryptography of Data Structures & Algorithms II
What is the formula used for decoding the ciphered text using affine cipher(a,b are constants and x is the numerical equivalent of a letter to be encrypted)?(a) a^-1(x-b)%26(b) (ax+b)%26(c) b^-1(x-a)%26(d) b^-1(x-a)I got this question by my college professor while I was bunking the class.My question is based upon Cryptography topic in division Cryptography of Data Structures & Algorithms II
What is the formula used for encryption of data using affine cipher(a,b are constants and x is the numerical equivalent of a letter to be encrypted)?(a) ax+b(b) (ax+b)%26(c) ax^2+bx(d) (ax^2+bx)%26This question was addressed to me in class test.I need to ask this question from Cryptography in division Cryptography of Data Structures & Algorithms II
Choose the weakest cipher from the following?(a) Vigenere cipher(b) Autokey cipher(c) Affine cipher(d) Hill cipherThe question was asked during an interview for a job.This key question is from Cryptography in portion Cryptography of Data Structures & Algorithms II
Which of the following cipher requires only one key for decoding the ciphered text?(a) Affine cipher(b) RSA(c) DSA(d) PKCSI have been asked this question during an interview for a job.Question is from Cryptography in division Cryptography of Data Structures & Algorithms II

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment