5 ms·
> What stops the feds from brute-force querying the whole database? What if the encryption was such that it took a computer ~ five minutes to decrypt the name?
by kevinventullo 6y ago
> What stops the feds from brute-force querying the whole database?
What if the encryption was such that it took a computer ~ five minutes to decrypt the name?
That’s still a speed up over the current system, but makes brute forcing impractical as decrypting 100 million records would take about a thousand years of compute. It would also enable auditing of who is doing the decrypting and who is being decrypted.
- nocommentguy 6y ago> What if the encryption was such that it took a computer ~ five minutes to decrypt the name? Perhaps if there was a way to future-proof (unknown-capability-of-NSA-proof), this could work. I can imagine the theatrics the media would put on if this slowed the police down enough to fail to prevent a murder... I prefer the “no records at all” approach.
- philwelch 6y agoNSA isn’t likely to tacitly compromise whatever unknown capabilities they have in order to participate in domestic law enforcement. I’m much more worried about ATF-proofing and FBI-proofing the system than NSA-proofing it. Also, to be blunt, 1,000 compute-years is no barrier to the NSA anyway.