Article

2007-12-17 Home Front: WoT

Judge: Man can't be forced to divulge encryption passphrase

Archived material is restricted to Rantburg regulars and members. If you need access email fred.pruitt=at=gmail.com with your nick to be added to the members list. There is no charge to join Rantburg as a member.

Posted by Anonymoose 2007-12-17 10:33|| || Front Page|| [3 views ] Top

#1 Niedermeier? Douglas R. Niedermeier, Jr? Class of '64?

Posted by mojo">mojo 2007-12-17 10:59|| 2007-12-17 10:59|| Front Page Top

#2 We have de-cryption programs, the cops are just to lazy to spend the time, money,and efort.

Looked for an easy way, and it backfired on them.

Posted by Redneck Jim 2007-12-17 11:19|| 2007-12-17 11:19|| Front Page Top

#3 We have de-cryption programs, the cops are just to lazy to spend the time, money,and efort.

Depending on the encryption algorithm he chose, the time could be until the heat-death of the universe, and the money and effort required would be enough to hasten that day's arrival.

Posted by Rob Crawford">Rob Crawford 2007-12-17 12:49|| http://www.kloognome.com/]">[http://www.kloognome.com/] 2007-12-17 12:49|| Front Page Top

#4 I'm sure the NSA could decrypt it over lunch. However, the NSA has higher demands then a pedophile to deal with and has no interest in becoming the locksmith for every law enforcement jurisdiction in the country.

Posted by Procopius2k 2007-12-17 14:34|| 2007-12-17 14:34|| Front Page Top

#5 The password is:

oogahboogahdoodleleedee,

Your welcome, from the ~~Psychotic~~ Psychic Network

Posted by Alaska Paul">Alaska Paul 2007-12-17 15:18|| 2007-12-17 15:18|| Front Page Top

#6 Proc, no they cannot, if the person used PGP properly and chose a long enough keylength and good passphrase.

NSA is good, but cannot violate basic laws of math regarding factoring of large number and other NPO-Hard issues.

They depend on the same math themselves.

Posted by OldSpook 2007-12-17 20:37|| 2007-12-17 20:37|| Front Page Top

#7 NP-hard, not NPO. In any case, we don't know if factoring is NP-hard or not. Let's recall the definitions:

P: Polynomial time--a problem that can be solved in time polynomial in the size of the problem

NP: Nondeterministic Polynomial time--a problem whose solutions can be checked in such polynomial time. Given two factors of a d-digit number, multiply them--it takes O(d^2) operations.

NP-complete: A problem such that every NP problem can be reduced to it.

NP-hard: A problem at least as hard as NP problems.

Factoring is NP, but not necessarily NP-hard. There seems to be disagreement on whether it is or not.

Now, if you can prove P=NP or the opposite, you'll be rich!

Posted by Eric Jablow">Eric Jablow 2007-12-17 21:12|| 2007-12-17 21:12|| Front Page Top

#8 Oy, Eric. Now my head hurts.

Posted by Barbara Skolaut">Barbara Skolaut 2007-12-17 22:31|| http://ariellestjohndesigns.com/]">[http://ariellestjohndesigns.com/] 2007-12-17 22:31|| Front Page Top

Posted by DMFD 2007-12-17 23:07|| 2007-12-17 23:07|| Front Page Top

23:11 Frank G
23:07 DMFD
22:59 DMFD
22:47 Anonymoose
22:46 Barbara Skolaut
22:31 Barbara Skolaut
22:27 mom
22:23 JosephMendiola
22:07 JosephMendiola
21:59 JosephMendiola
21:57 Alaska Paul
21:56 JosephMendiola
21:53 Frank G
21:53 JosephMendiola
21:46 JosephMendiola
21:41 SteveS
21:40 SteveS
21:39 doc
21:38 Pappy
21:38 doc
21:37 Shieldwolf
21:31 JosephMendiola
21:26 Pappy
21:25 Grumenk Philalzabod0723