Gover's Algorithm[1] halves the time to search an unsorted list. Which basically means the time to pick a random number 200 bits long, is now equal to the time

Gover's Algorithm[1] halves the time to search an unsorted list. Which basically means the time to pick a random number 200 bits long, is now equal to the time to pick a random number 100 bits long. Keys as large as 60 bits are currently vulnerable to attack[2], so logically post grover's algorithm we could attack 120 bit symmetric encryption. If that doesn't make sense Bruce Schneier explains it also. [3] [1] http://en.wikipedia.org/wiki/Grover%27s_algorithm http://en.wikipedia.org/wiki/Grover%27s_algorithm [2] http://en.wikipedia.org/wiki/Data_Encryption_Standard http://en.wikipedia.org/wiki/Data_Encryption_Standard [3] http://www.youtube.com/watch?v=dJh0mIJn6kE&feature=player_detailpage#t=188 http://www.youtube.com/watch?v=dJh0mIJn6kE&feature=player_de...