This preview shows page 1. Sign up to view the full content.
Unformatted text preview: k 1 ) …, k n = h ( k n-1 ) • Passwords used in the order: p 1 = k n , p 2 = k n-1 , …, p n = k 1 • Suppose p 1 = k n is intercepted; the next password is p 2 = k n-1. Since h ( k n-1 ) = k n , the attacker needs to invert h to determine the next password. This is not an easy task since h is a one-way function....
View Full Document
This note was uploaded on 02/07/2012 for the course SIS 2150 taught by Professor Joshi during the Fall '11 term at Pittsburgh.
- Fall '11