Computer Engineering II, Quiz 12
Sign in to Google to save your progress. Learn more
The CAESAR encryption works by cyclically shifting all letters by 1<= x <= 25 positions in the alphabet, e.g., a becomes d with x=3. If you apply CAESAR twice with different x, is it more secure?
Clear selection
To find a large prime easily, you propose the following: You take all primes until some x, multiply them with each other, and subtract 1, resulting in a  prime p. You then get another prime p' by p'=(p+1)p-1, which can be iterated. Does this method work?
Clear selection
Alice wants to send a 1 if her answer is yes, and a 0 if her answer is no. To do so, she chooses a one-time pad of one bit as encryption. Is this method malleable?
Clear selection
Malleability can be prevented by hashing the ciphertext, and sending the hash together with the ciphertext
Clear selection
Submit
Clear form
This content is neither created nor endorsed by Google. - Terms of Service - Privacy Policy

Does this form look suspicious? Report

Google Forms