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
Which one is the first operating system?
Is 6 cores enough for streaming?
Can kernel panic be fixed?
What is operating system and its examples?
What are positional parameters?
what is ms configure?
What is startup repair on my computer?
1) What is an Virtual memory? 2) How do we test API's in both Windows/Linux/Unix? 3) What is an IOCTL? 4) How do you open a char device through API's? 5) What is major num/ minor num? 6) What is the max num for minor num? 7) Who gives you the major / minor numbers? 8) Reverse a string using recursive func. 9) fork/vfork/clone. 10) What does fork returns? 11) What is a zombie process? 12) What happens when a child completes before parent tries to wait for it? 13) Interrupt handlers, top-hdnl....?
Will disk cleanup delete my files?
what is multitask win95
What is difference between post and put method?
Which intel core is best?
How many os are there?
Can we compare two files in notepad ++?
Is microsoft coming out with a new operating system?