We know that the one$-$time pad is secure$,$ according to its

own model, even against a computationally unbounded

adversary. Explain why it is impossible for public key encryption

to offer any meaningful security when facing a computationally

unbounded adversary. Please describe an explicit attack.

$($Hint: This holds true even if the adversary has only seen the

public key and not any ciphertext.$)$ Q$2$: We know that the one$-$time pad is secure$,$ according to its own model, even against a computationally unbounded adversary. Explain why it is impossible for public key encryption to offer any meaningful security when facing a computationally unbounded adversary. Please describe an explicit attack.

$($Hint: This holds true even if the adversary has only seen the public key and not any ciphertext.$)(10$ pts$)$