[118971] in Cypherpunks
Scheme to defeat all keyboard sniffers
daemon@ATHENA.MIT.EDU (Gary Jeffers)
Mon Oct 11 15:40:55 1999
Message-ID: <19991011192128.57532.qmail@hotmail.com>
From: "Gary Jeffers" <jeffersgary@hotmail.com>
To: cypherpunks@cyberpass.net
Date: Mon, 11 Oct 1999 14:21:27 CDT
Mime-Version: 1.0
Content-Type: text/plain; format=flowed
Reply-To: "Gary Jeffers" <jeffersgary@hotmail.com>
Fellow Cypherpunks,
Michael Motyka believes that my scheme would be too slow on input. I
estimate that data entry would be about 1/2 or 1/3 usual rate. If
routine was used for short input, especially passwords or passphrases,
then this would not be a problem.
Sean Roach says that scheme is convoluted. No, there would be a little up
front time getting used to it but it is simple. Sean also mentions different
email address - lost telephone - using public computers for the Internet.
Jonathan Wienke says "Caesar Cipher" - OH how CREUUUULLL!!!. Ok
version 1 of scheme is vulnerable to a frequency distribution of
alphabet attack, but I believe that a small change would make it
invulnerable. Instead of a key press using up only that particular
corresponding cipher letter, version 2 would have it using up ALL cipher
letters. So that the RNG would have to generate new cipher letters for all
the static keys.
As long as the sniffer only sniffed the keyboard and not the
monitor, the scheme would be unbreakable. Version 3 or 4 destroys
the states.
While I'm at it, I name the routine THE ANTISNIFF. :-)
Yours Truly,
Gary Jeffers
Expert: A guy who knows his subject from b to z. You sure that's a
joke?
Remorseless logic requires remoresless logicians.
BEAT STATE!!!!!!
______________________________________________________
Get Your Private, Free Email at http://www.hotmail.com
