1. Suppose a chosen-ciphertext attacker cannot recover the secret decryption key for an encryption scheme. Does this mean theencryption scheme is secure?
2. Consider a symmetric-key cryptosystem in which cryptographic keys are randomly selected from the set of all n-bit strings. Approximately what should n be in order to provide 128 bits of security against a birthday attack?