Answer (Choose 2 answers)
ㅁㅁㅁㅁ
Which of the following statements are true about brute force attacks? Select all that apply.
A. Brute force attacks try every possible key until the correct one is found.
B. The time complexity of brute force attacks is exponential in the key length.
C. Brute force attacks rely on mathematical weaknesses in the encryption algorithm.
D. Brute force attacks are the most efficient attacks for breaking encryption.
exam.
FU inish the e
