1.

There is no secret key in case of ____________(a) Symmetric ciphers(b) Asymmetric ciphers(c) RSA encryption(d) Alpha-numeric cryptographyI have been asked this question during an internship interview.My query is from Cryptography topic in section Number Theory and Cryptography of Discrete Mathematics

Answer» RIGHT answer is (a) Symmetric ciphers

The best explanation: A symmetric algorithm uses the same key to ENCRYPT DATA as WELL as to decrypt data. For example, a symmetric algorithm will use the key to encrypt some plaintext information like a password into a ciphertext. Then, it uses again to TAKE that ciphertext and turn it back into the password.


Discussion

No Comment Found

Related InterviewSolutions