Question $7$

An cryptographic algorithm can be considered broken when $($choose multiple$)$

The algorithm used for encryption is discovered by the attacker

The secret key can be discovered by an attacker

Messages can be decrypted without the key

Weaknesses are discovered that reduce the strength of the algorithm