From: donadio@wilbur.psu.edu (Beaker) Subject: Re: Weird group problems under .99.3 Date: 15 Jan 1993 02:14:57 GMT
Peter MacDonald (pmacdona@sanjuan) wrote:
: I have heard that it is possible to reduce the search field
: when trying to crack passwords, if you have the source. I am
: not an expert in security (is anyone), but I do know that with
: enough processing power you can crack any password, if you
: have the algorithm used, and the encrypted string.
This is how ufc-crypt works. It works on an algorith based on
speed-up as a result of multiple crypts with the same salt. Yes,
with enough power you can get any password, but to do it effectively
and quickly you would need something a fine-grain process on a CM-5
or T3D.
Getting this back on the subject of Linux, I think that work needs to
be started on a network authentication system, like Kerberos. I
started to work on Kerberos over Christmas, but I didn't get anywhere.
Perhaps we could use a subset of it. Comments? (Ted???)