100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached 4.2 TrustPilot
logo-home
Exam (elaborations)

UIUC CS 461 Final Exam Questions With 100- Verified Answers.docx

Rating
-
Sold
-
Pages
27
Grade
A+
Uploaded on
19-12-2025
Written in
2025/2026

UIUC CS 461 Final Exam Questions With 100- Verified A

Institution
CS,.
Course
CS,.










Whoops! We can’t load your doc right now. Try again or contact support.

Written for

Institution
CS,.
Course
CS,.

Document information

Uploaded on
December 19, 2025
Number of pages
27
Written in
2025/2026
Type
Exam (elaborations)
Contains
Questions & answers

Subjects

Content preview

UIUC CS 461 Final Exam Questions
With 100% Verified Answers
What are the steps in authentication? -
correct answer ✅Identification
Verification (binds entity and identity)
You are who you say you are.


What are verification methods? -
correct answer ✅Something you know - e.g. Passwords
Something you have - e.g. token based
Something you are - e.g. biometric


List password attacks. -
correct answer ✅*Steal from user - Install a keylogger (hardware
or software)
- Find it written down
- Social engineering/Phishing
- Intercept the password over network
- Use a side channel


* Steal from service

,UIUC CS 461 Final Exam Questions
With 100% Verified Answers
* Steal from a third party (password reuse)


Location of passwords on UNIX -
correct answer ✅/etc/shadow


Simply storing hashes of passwords is not enough to ensure
security of the password database. What are the other mechanisms
that are combined with hashing? -
correct answer ✅Salt (a random number / nonce) - does not have
to be secret - simply unique
Pepper - must be secret and stored separately from the password
database - such as in a configuration file - added to plaintext prior
to hashing


Advantages of salting password databases. -
correct answer ✅* Makes rainbow tables worthless - prohibitively
large
* Protect commonly used / reused passwords (each password must
be cracked individually)


Specific trait of Blowfish -
correct answer ✅* Block cipher

, UIUC CS 461 Final Exam Questions
With 100% Verified Answers
* Long preprocessing setup for each key
* Processes about 4 kB of data, key scheduling to prepare
substitution boxes


Algorithms / Hash functions with special features? -
correct answer ✅* bcrypt - applies blowfish repeatedly - designed
to take a lot of (configurable) time
* scrypt - must generate large random bit vector which must be
randomly accessed during computation


- Designed to take a lot of memory to compute


- Also used as proof of work hash for Litecoin and Dogecoin


Algorithm with configurable time + memory + parallelism required
to compute -
correct answer ✅Argon2, which won password hashing
competition in 2015


What does a smart card protect against, over a static memory card,
for token-based authentication? -

Get to know the seller

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
Cindellera stuvia
View profile
Follow You need to be logged in order to follow users or courses
Sold
111
Member since
1 year
Number of followers
2
Documents
10567
Last sold
1 day ago

4.0

24 reviews

5
10
4
6
3
6
2
1
1
1

Recently viewed by you

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Frequently asked questions