sci.crypt
  Home FAQ Contact Sign in
sci.crypt only
 
Advanced search
July 2008
motuwethfrsasuw
 123456 27
78910111213 28
14151617181920 29
21222324252627 30
28293031    31
2008
 Jan   Feb   Mar   Apr 
 May   Jun   Jul   Aug 
 Sep   Oct   Nov   Dec 
2008 2007 2006  
total
sci.crypt Profile…
RELATED GROUPS

POPULAR GROUPS

 Up
  WPA2-PSK safty despite PSK compromise         


Author: Thorsten Tarrach
Date: Jul 16, 2008 07:57

Hi,

I'm wondering about WPA2 safety in the scenario of a compromised preshared
key (PSK).
I'm aware that the protocol is safe by today's knowledge if they key is kept
secure.
But what if I share the key with another person to enable that person to use
my AP. Will that break confidentiality of my communication with the AP?
The AES encryption key is derived from the PSK in some form of handshake. I
want to know now if someone else can obtain that key by capturing the
handshake and knowing the PSK?

Thanks, Thorsten
6 Comments
  Algorithm Strength Scale         


Author: WTShaw
Date: Jul 16, 2008 00:38

Many have questioned whether cryptological strength can be adequately
described. Perhaps some unknown method may be found to break a system
therefore rendering it useless for serious purposes. And, different
qualifiers have been advanced to champion a chosen algorithm. Well,
there are only just a couple of considerations that do actually
matter, can the whole functional key(s) be derived using chosen text,
and how much information is necessary to verify that the true
plaintext has been recovered.

While the otp is the best in one category and the worst in the other,
see that it as functionally defective, a one-sheet paper plane in a
fleet of many birds. Perhaps no other algorithm is so extreme as the
otp so as the exception it proves the rule...that other algorithms are
a better choice for almost every reason.

Dealing with scaled strength in an intelligent manner is what this
posting is about, even that categories of strength can and should be
mathematically defined and therefore different algorithms and keys
compared as to their ratings.
Show full article (3.39Kb)
11 Comments
  JSH's next breakthrough         


Author: Tim Smith
Date: Jul 16, 2008 00:09

Those dazzled by his breakthroughs in factoring and FLT who are eager to
see what his next breakthrough will be might find
comp.lang.java.programmer interesting. JSH has started posting there
about his new project: solving the traveling salesman problem.

--
--Tim Smith
45 Comments