Cryptography-Digest Digest #692
Cryptography-Digest Digest #692, Volume #12 Sat, 16 Sep 00 10:13:01 EDT
Contents:
Tying Up Loose Ends - Correction (John Savard)
Re: "Secrets and Lies" at 50% off (Tom St Denis)
Re: Double Encryption Illegal? (Tom St Denis)
Re: "Secrets and Lies" at 50% off (Tom St Denis)
Re: "Secrets and Lies" at 50% off (John Winters)
non-linear decorrelation? (Tom St Denis)
Re: "Secrets and Lies" at 50% off (SCOTT19U.ZIP_GUY)
Re: Tying Up Loose Ends - Correction (SCOTT19U.ZIP_GUY)
QUESTION ABOUT ALGORITHMS ("Melinda Harris")
Re: "Secrets and Lies" at 50% off (Tom St Denis)
Re: non-linear decorrelation? (Tom St Denis)
another nonlinear decorrelation idea (Tom St Denis)
From: [EMAIL PROTECTED] (John Savard)
Subject: Tying Up Loose Ends - Correction
Date: Sat, 16 Sep 2000 11:08:41 GMT
I finally got around to fixing two incorrect links in the description
of Quadibloc II (the "Up" links of the last two pages) because I had
something more exciting to do.
In
http://home.ecn.ab.ca/~jsavard/crypto/mi060303.htm
the page entitled "Tying Up Loose Ends", to the four awkward schemes I
provided to deal with the fact that a pseudo-Morse code always has one
symbol less than the Huffman code to which it corresponds, I have now
provided a scheme which is both efficient and which avoids
backtracking.
Since this is an element of David A. Scott's encryption proposals, and
since he claimed he didn't have the kind of difficulties with the last
symbol that I encountered, possibly this is the method he is using. If
so, I will have to credit him specifically in this case: while I think
the basic notion of coding the last symbol in a general fashion, where
a message is represented by a prefix-property binary code, and the
resulting message is transmitted with an explicit length indication,
is almost certain to have occurred to people at an early stage in the
development of this field (maybe even before Huffman came forward with
his replacement for Shannon-Fano coding), the specific scheme of using
a code that is shifted down one symbol after either the least frequent
symbol or the least frequent symbol followed by any number of
repetitions of the second least frequent symbol so as to achieve an
optimal scheme not requiring backtracking is at a level of detail that
no one might necessarily have ever bothered with before.
John Savard
http://home.ecn.ab.ca/~jsavard/crypto.htm
--
From: Tom St Denis [EMAIL PROTECTED]
Crossposted-To: comp.security.misc
Subject: Re: "Secrets and Lies" at 50% off
Date: Sat, 16 Sep 2000 11:58:03 GMT
In article [EMAIL PROTECTED],
[EMAIL PROTECTED] (John Savard) wrote:
On Thu, 14 Sep 2000 22:13:42 GMT, Tom St Denis [EMAIL PROTECTED]
wrote, in part:
I know you are well intentioned but for the same reason I don't like
other spammers, I would suggest that you don't do this.
If you want to talk about your book by all means go ahead, but you
really are spamming this group.
Just my two cents, and seriously no offence intended.
In a sense, you might have a point; he is flogging a book on which he
is making money. But very few people will agree with you that his post
didn't belong, because many people were going to buy this book, and
information on how to save money on it is therefore useful: it is very
different from wasting bandwith trying to push something hardly anyone
particularly wants.
It's not whether people want the book or not. Nobody asked "how much
does it cost" he just posted an ad. That's spam and there is no way to
go about it. Does he care what we think about the book? Can we find
out what he thinks about the book? Apparently not.
However, many people will be very much tempted by your post to call
you bad names, and so on. Why?
Well: it appears obvious that your post is prompted by dismay at the
unfairness of a world where people like Bruce Schneier recieve respect
while people like David A. Scott recieve derision.
And as to how that looks to others - despite the fact that Mr. Scott's
two main points are valid in themselves (key dependent S-boxes are
good, and the larger the better; compression prior to encryption
deserves attention specifically related to encryption as an
application) - words appropriate to polite discussion fail me.
His points are valid but he goes about them the wrong way. (see below).
Hey, wait a minute: why does it look so bad, if Mr. Scott is famous
for advocating two _valid_ points? It isn't just a veneration of style
over substance, or respect accorded to markers of status like having a
book published.
The so-called "crypto gods" claim that the issues pursued by Mr. Scott
are minor ones. And their reasoning is valid for reasons people can
understand.
When someone constantly mocks
Cryptography-Digest Digest #692
Cryptography-Digest Digest #692, Volume #10 Mon, 6 Dec 99 15:13:01 EST
Contents:
Re: Will ScramDisk recover ? After another round of tests ... YES, it (Paul
Koning)
Re: Johnson Device ("Martin Peach")
Re: Johnson Device ("Martin Peach")
Re: Data Encryption in Applet? ("Tim Wood")
Re: Noise Encryption ("Trevor Jackson, III")
Re: Quantum Computers and Weather Forecasting (Richard Herring)
Re: DES ECB vs CBC (Paul Koning)
Re: Wanted: One-way hash sourcecode or algorithm (Paul Koning)
Re: Random Noise Encryption Buffs (Look Here) ("r.e.s.")
Re: Johnson Device (Jim Dunnett)
Re: how to combine hashes to build a 128-bit key? (Stefek Zaba)
Re: Random Noise Encryption Buffs (Look Here) ("Trevor Jackson, III")
Re: NSA should do a cryptoanalysis of AES (Tim Tyler)
Encrypting numbers? (Michael Groh)
Re: NSA should do a cryptoanalysis of AES (Tim Tyler)
Re: Random Noise Encryption Buffs (Look Here) (Tim Tyler)
USENIX Security Symposium 2000 - A Call for Papers (Moun Chau)
From: Paul Koning [EMAIL PROTECTED]
Crossposted-To:
alt.security.pgp,comp.security.pgp.discuss,alt.security.scramdisk,comp.security.pgp.tech
Subject: Re: Will ScramDisk recover ? After another round of tests ... YES, it
Date: Mon, 06 Dec 1999 12:02:10 -0500
Lincoln Yeoh wrote:
On Fri, 3 Dec 1999 08:04:09 -0500, "Microsoft Mail Server"
[EMAIL PROTECTED] wrote:
the fact that scramdisk retains the essence of boot,fat, data sector
structure is a prime reason it is so durable.
try making two identical container files of moderate size. load some text
files into the svl's for reference points, then swap the boot sector on
each. try swapping the fat structures. very interesting indeed!
What happens?
I'm too lazy to swap boot sectors - I don't have a utility which can copy
sectors to another file easily.
Boot up linux and use dd. (That's how I repair broken DOS
filesystems...)
paul
--
From: "Martin Peach" [EMAIL PROTECTED]
Subject: Re: Johnson Device
Date: Mon, 6 Dec 1999 11:18:33 -0500
Kurt Fleißig wrote in message 82eau6$do$[EMAIL PROTECTED]...
does anybody use an hadrware device to obtain from the thermodynamic
Johnsons's effect of the Pc's sound blaster a big bit's chaotic stream for
one-time-pad encryption?
The soundblaster itself is a hardware device...perhaps if you set the input
gain to maximum on the microphone channel, you will have a few bits of
noise, otherwise you could make a plug with a one-megohm resistor between
signal in and ground and try to read the noise directly from the resistor.
You might need a preamplifier though, in which case you will start
amplifying electrical hum and so forth as well, so you need to start being
concerned about shielding the circuit.
\/\/\/*= Martin
--
From: "Martin Peach" [EMAIL PROTECTED]
Subject: Re: Johnson Device
Date: Mon, 6 Dec 1999 11:18:33 -0500
Kurt Fleißig wrote in message 82eau6$do$[EMAIL PROTECTED]...
does anybody use an hadrware device to obtain from the thermodynamic
Johnsons's effect of the Pc's sound blaster a big bit's chaotic stream for
one-time-pad encryption?
The soundblaster itself is a hardware device...perhaps if you set the input
gain to maximum on the microphone channel, you will have a few bits of
noise, otherwise you could make a plug with a one-megohm resistor between
signal in and ground and try to read the noise directly from the resistor.
You might need a preamplifier though, in which case you will start
amplifying electrical hum and so forth as well, so you need to start being
concerned about shielding the circuit.
\/\/\/*= Martin
--
From: "Tim Wood" [EMAIL PROTECTED]
Crossposted-To:
comp.lang.java.security,microsoft.public.java.security,comp.lang.java.programmer
Subject: Re: Data Encryption in Applet?
Date: Mon, 6 Dec 1999 17:28:49 -
wrote in message [EMAIL PROTECTED]...
Hi
I am looking for a way to encrypt data through an applet using symmetric
(or asymmetric) encryption. I thought of sending an applet containing a
symmetric key to a client.
How? If the symmetric key is not encrypted when you send it, it could be
intercepted and used to read the, client side encrypted, data.
This is key is to perform encryption on some
data on the client side. Anybody has any idea how to do this in Java or
has any source codes in Java?
Thanks in advance
Greg
tim
--
**Stolen line alert**
From my one-bit brain with a parity error.
**/Stolen line alert**
--
Date: Mon, 06 Dec 1999 12:58:26 -0500
From: "Trevor Jackson, III" [EMAIL PROTECTED]
Subject: Re: Noise Encryption
Guy Macon wrote:
In article 82g2km$dck$[EMAIL PROTECTED], [EMAIL PROTECTED] (Tim Wood)
wrote:
The real problem
