From: “Perry E. Metzger” <pmetzger@lehman.com>
To: Matthew J Ghio <mg5n+@andrew.cmu.edu>
Message Hash: 1488d27f4ff7ce223d7df4a782458de6ef9de1f575ab0504e4ec79a25539cfd4
Message ID: <9311181820.AA28976@snark.lehman.com>
Reply To: <UguvWNa00awFM8JmNl@andrew.cmu.edu>
UTC Datetime: 1993-11-18 18:21:31 UTC
Raw Date: Thu, 18 Nov 93 10:21:31 PST
From: "Perry E. Metzger" <pmetzger@lehman.com>
Date: Thu, 18 Nov 93 10:21:31 PST
To: Matthew J Ghio <mg5n+@andrew.cmu.edu>
Subject: Re: List of one-shot passwords
In-Reply-To: <UguvWNa00awFM8JmNl@andrew.cmu.edu>
Message-ID: <9311181820.AA28976@snark.lehman.com>
MIME-Version: 1.0
Content-Type: text/plain
Matthew J Ghio says:
> "Alan (Gesture Man) Wexelblat" <wex@media.mit.edu> wrote:
>
> > It seems to me that a simpler solution than challenge-response would
> > be to emultate the tear-sheet crypto systems and just have a series of
> > one-shot passwords generated. Each time you log in, it requires the
> > next password from the sheet, so capturing the old one does no good
> > (just as breaking the one-time codes from tear sheets doesn't help).
> >
> > Now if I could just figure out a simple way to do this on UNIX...
>
> You can use a sequential PRNG to do this, and then add a scrambling
> system to the output (to confuse anyone trying to break the pattern). I
> once wrote a program to do this (just for experimentation, and not in
> UNIX...).
You want to use a cryptographically strong one, however, because most
PRNGs are easily guessed. This in practice means using MD5 or DES or
IDEA or something as an RNG.
Perry
Return to November 1993
Return to “sommerfeld@orchard.medford.ma.us (Bill Sommerfeld)”