CYB 210 EXAM 2025 QUESTIONS AND
ANSWERS
Informational Security vs Computational Security
If it takes more than 100,000,000,000,000,000,000 years at trying 100 billion keys per second to
eventually find the key, is this informationally secure?
Yes
No - ANS No
Besides number of operations, other factors affect the cost of an attack. Which of the following
is NOT one of them?
Number of targets
Location
Parallelism
Memory
Precomputation - ANS Location
Hash tables are associated with which of the following?
Parallelism
Age
Memory
Number of targets
Copyright ©2025 THEBRIGHT ALL RIGHTS RESERVED 1
, Precomputation - ANS Precomputation
What is Moore's Law?
Loosely speaking, processor speed doubles every 2 years.
The more targets, the easier it is to defeat cryptography system
cryptographic system should be designed to be secure, even if all its details, except for the key,
are publicly known.
Less is Moore and Moore is Less - ANS Loosely speaking, processor speed doubles every 2
years.
Proving our cryptography is as hard to solve as another problem declared to be hard is known
as what kind of reasoning?
heuristic
indistinguishability
reduction
child - ANS reduction
HINT: n = pq
Which of the following is a semiprime?
10
11
3
5 - ANS 10
What kind of security is reached if a security proof cannot be developed?
Copyright ©2025 THEBRIGHT ALL RIGHTS RESERVED 2
ANSWERS
Informational Security vs Computational Security
If it takes more than 100,000,000,000,000,000,000 years at trying 100 billion keys per second to
eventually find the key, is this informationally secure?
Yes
No - ANS No
Besides number of operations, other factors affect the cost of an attack. Which of the following
is NOT one of them?
Number of targets
Location
Parallelism
Memory
Precomputation - ANS Location
Hash tables are associated with which of the following?
Parallelism
Age
Memory
Number of targets
Copyright ©2025 THEBRIGHT ALL RIGHTS RESERVED 1
, Precomputation - ANS Precomputation
What is Moore's Law?
Loosely speaking, processor speed doubles every 2 years.
The more targets, the easier it is to defeat cryptography system
cryptographic system should be designed to be secure, even if all its details, except for the key,
are publicly known.
Less is Moore and Moore is Less - ANS Loosely speaking, processor speed doubles every 2
years.
Proving our cryptography is as hard to solve as another problem declared to be hard is known
as what kind of reasoning?
heuristic
indistinguishability
reduction
child - ANS reduction
HINT: n = pq
Which of the following is a semiprime?
10
11
3
5 - ANS 10
What kind of security is reached if a security proof cannot be developed?
Copyright ©2025 THEBRIGHT ALL RIGHTS RESERVED 2
