Assume that passwords are selected from four-character
combinations of 26 alphabetic characters. Assume that an
adversary is able to attempt passwords at a rate of one per
second.
a) Assuming no feedback to the adversary until each attempt
has been completed, what is the expected time to discover
the correct password?

Answer Posted / amos

a) involves sequences, thus, 26^4 = 456,976 seconds which is worst case hence average case would be 456,976/2 = 228, 488 seconds or 63.7 hours or ~ 2 days.

b) involves multiplication principle, thus, worst case scenario would be 26*4 = 104 seconds hence average case is 104/2 = 52 seconds

Is This Answer Correct ?    2 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Directories can be implemented either as "special files" that can only be accessed in limited ways, or as ordinary data files. What are the advantages and disadvantages of each approach?

4024


What do you mean by Run time Errors?

721


What is the first operating system in the world?

563


Is more ram better for streaming?

498


What is a file in os?

624






Is system restore bad for your computer?

550


What is the latest version of google browser?

559


What does kernel panic mean?

559


Can we compare two files in notepad ++?

579


Assuming one link of the Trojan horse copy-and-observe-later chain is broken. There are two other possible angles of attack by Alice: Alice logging on and attempting to read the string directly, and alice assigning a security level of sensitive to the back-pocket file. Does the reference monitor prevent these attacks?

2393


Which is better curl or wget?

591


How do you pronounce gnu?

559


How many bytes we can send to apple push notification server in iOS operating system?

625


Why is my computer so slow?

550


What are compile time Errors?

618