Neco 2021 Data Processing Question 42
Practice objective / multiple choice question 42 from the 2021 Neco Data Processing examination.
A company wants to protect its data with a symmetric encryption key. The time (in seconds) required to brute‑force a key of length n bits is approximated by \(T = \dfrac{2^{n}}{10^{9}}\), assuming a super‑computer can test one billion keys per second. The key length must not exceed 128 bits, and the brute‑force time must be longer than the data‑retention period of 10 years. Determine the maximum key length that satisfies both constraints, and then calculate the factor by which the resulting brute‑force time exceeds the 10‑year period. Express the factor in scientific notation rounded to two decimal places.
Answer Options
About This Question
This is Neco 2021 Data Processing Question 42. It is one of the objective questions from the 2021 Neco Data Processing examination.
Difficulty level: Hard .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.