Cryptography-Digest Digest #604, Volume #10 Sun, 21 Nov 99 14:13:03 EST
Contents:
Re: Do flight data recorders use encryption? (Casper H.S. Dik - Network Security
Engineer)
Re: Cryptological discovery, rediscovery, or fantasy? (Lieven Marchand)
Europe Internet Banking Security Research (Stephen Yip)
math (JPG)
Open request about the NOVA cipher challenge (Sundial Services)
Re: AES cyphers leak information like sieves (SCOTT19U.ZIP_GUY)
Re: The DVD Hack: What Next? (Sundial Services)
exchanging tips on code book ([EMAIL PROTECTED])
Filters, Superpositions and Entanglements ([EMAIL PROTECTED])
Re: Nova program on cryptanalysis -- also cipher contest (Sean A. Walberg)
Have some hints. Re: Nova program on cryptanalysis -- also cipher contest (William
Rowden)
----------------------------------------------------------------------------
From: [EMAIL PROTECTED] (Casper H.S. Dik - Network Security Engineer)
Subject: Re: Do flight data recorders use encryption?
Date: 21 Nov 1999 10:01:35 GMT
[[ PLEASE DON'T SEND ME EMAIL COPIES OF POSTINGS ]]
albert <[EMAIL PROTECTED]> writes:
>I was just thinking, I'm not a big fan of the government, and I don't
>trust them. So I have no idea if what they are telling us (and the
>press) is true. I'm wondering if they have some method themselves of
>confirming the authenticity of the data recorders.
No. One reason not to use encryption is that you will capture less data
as iencryption will introduce a small delay in recording (this is
already a problem for digital flight data recorders; they record a
few seconds fewer data in the event of a crash than the analog models)
Casper
--
Expressed in this posting are my opinions. They are in no way related
to opinions held by my employer, Sun Microsystems.
Statements on Sun products included here are not gospel and may
be fiction rather than truth.
------------------------------
From: Lieven Marchand <[EMAIL PROTECTED]>
Crossposted-To: sci.math,sci.misc,alt.privacy
Subject: Re: Cryptological discovery, rediscovery, or fantasy?
Date: 20 Nov 1999 22:38:38 +0100
DSM <[EMAIL PROTECTED]> writes:
> Could such an algorithm exist? Is it already in use?
There is a steganographic file system for Linux. It has IIRC 12
possible levels of security for files. Access to a level implies
access to all lower levels. In your example, you could put some mildly
incriminating stuff on levels 1, 2 and 3 and hope to convince your
captors that they've got all.
--
Lieven Marchand <[EMAIL PROTECTED]>
If there are aliens, they play Go. -- Lasker
------------------------------
From: Stephen Yip <[EMAIL PROTECTED]>
Subject: Europe Internet Banking Security Research
Date: Sun, 21 Nov 1999 20:19:40 +0800
This is a multi-part message in MIME format.
==============C5E1927F9870BBB8FC2148AB
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Dear All,
We're now organizing a short research on Europe Internet Banking
Security. Are there any homepages that we can refer to?
Thanks.
==============C5E1927F9870BBB8FC2148AB
Content-Type: text/x-vcard; charset=us-ascii;
name="klyip.vcf"
Content-Transfer-Encoding: 7bit
Content-Description: Card for Stephen Yip
Content-Disposition: attachment;
filename="klyip.vcf"
begin:vcard
n:Yip;Stephen
x-mozilla-html:FALSE
adr:;;;Hongkong;;;
version:2.1
email;internet:[EMAIL PROTECTED]
fn:Stephen K.L. Yip
end:vcard
==============C5E1927F9870BBB8FC2148AB==
------------------------------
From: JPG <[EMAIL PROTECTED]>
Reply-To: [EMAIL PROTECTED]
Subject: math
Date: Sun, 21 Nov 1999 14:29:10 GMT
Hello
I'm looking for a crypt system with something interesting for my maths
studies.
Could you help me (I'm already aware of RSA) ?
(sorry for my bad english)
Thanks.
JPG.
------------------------------
Date: Sun, 21 Nov 1999 08:16:47 -0700
From: Sundial Services <[EMAIL PROTECTED]>
Reply-To: [EMAIL PROTECTED]
Subject: Open request about the NOVA cipher challenge
I think that the NOVA program organizers set much too short of a time
limit before Jim will reveal the answers. (The program did not really
showcase the contest anyway.)
I hope that the organizers will reveal the answers on the NOVA program
web-site only in a way that (a) requires a separate button click; and
(b) does not reveal more than one cipher solution at one time.
It would also be nice if, in addition to this, (c) there were a page
where only -clues- or -hints for solving the problem- were revealed
first. This would make the site more educational although I know it
means that he'll be doing some fancy writing on short notice.
Anyhow, loads of amateur cryptanalysts will be enjoying these puzzles
for many months. It turns out to be one of the more enjoyable aspects
of the site.
There -are- crypto programs for Playfair, etc. but I know also that a
lot of people will be writing computer-programs to test solutions.
These would make interesting thread-topics too.
========================================================================
Sundial Services :: Scottsdale, AZ (USA) :: (480) 946-8259
mailto:[EMAIL PROTECTED] (PGP public key available.)
> Got Paradox/Delphi database headaches? ChimneySweep{tm} can help, FAST!
> http://www.sundialservices.com/cs3web.htm
------------------------------
From: [EMAIL PROTECTED] (SCOTT19U.ZIP_GUY)
Subject: Re: AES cyphers leak information like sieves
Date: Sun, 21 Nov 1999 16:11:37 GMT
In article <[EMAIL PROTECTED]>, [EMAIL PROTECTED]
(John Savard) wrote:
>On Sun, 21 Nov 1999 00:00:54 +0000, Toby Kelsey
><[EMAIL PROTECTED]> wrote:
>
>>Check <[EMAIL PROTECTED]> posted on 02/02/1999 for
>>the original exposition. Ironically I was correcting dscott at the time.
Funny I could not find it in Deja View when search form jan 1 1999 to Apr
1 1999. But only after looking at all the pose from toby.
I could not find where you where correcting me Mr Savard. However we
do argue all the time. I still wonder when your going to admit that
PGP does or did not use CBC as recently pointed out again by an
expert on PGP.
>
>I checked at DejaNews, and found a post of that date in the thread
>"What is Left to Invent". In there, you noted that if a message is
>sufficiently well compressed that the probability of a sensible
>message is greater than 1/2^N, for an N-bit key, ambiguity is created.
>
>What David Scott is discussing is a method of compression where the
>probability is 1 that a random string of bits will be valid compressor
>output, although the probability that *other*, more sophisticated,
>tests will indicate that the source message made sense depends on the
>quality of the compression.
>
>I don't know if that was original with him; I would have thought this
>was something thought of long ago, but it isn't an idea that comes up
>often.
I am 99% sure it is the kind of thing the NSA would have thought up.
Maybe it has been thought up in public only to get quickly surpressed
by those that do the bidding of the NSA. Note how quick Mr Wagner
is to imply that my work is nothing. Even though he and Mr BS poopoo
my work and spread lies about how good the Slide Attack is. The son
of a bitch has the gall to say scott19u is weak. Then when his precious Slide
Aattack falls on its ass. He only once posted that he never really was
able to follow the code. Yet that does not stop him from saying my stuff
can't be good and yet he lacks the intelligence to look at it. I guess he
gets his arragance training from his boss Mr BS himself. But then again
it makes sense since they both fall far short of the ability to do
work good enough to be hired directly by the NSA other than public
PR hachet men.
David A. Scott
--
SCOTT19U.ZIP NOW AVAILABLE WORLD WIDE
http://www.jim.com/jamesd/Kong/scott19u.zip
Scott famous encryption website NOT FOR WIMPS
http://members.xoom.com/ecil/index.htm
Scott rejected paper for the ACM
http://members.xoom.com/ecil/dspaper.htm
Scott famous Compression Page WIMPS allowed
http://members.xoom.com/ecil/compress.htm
**NOTE EMAIL address is for SPAMERS***
------------------------------
Date: Sun, 21 Nov 1999 08:35:23 -0700
From: Sundial Services <[EMAIL PROTECTED]>
Reply-To: [EMAIL PROTECTED]
Subject: Re: The DVD Hack: What Next?
Sigh... these are the same media companies who destroyed the market for
the DAT tape for fears of piracy, and who now seem to continue to be
able to sell CD's in spite of the proliferation of CD-ROM burners.
Won't they ever learn that their product just isn't that interesting
anyway? Sure, someone could copy it -- but they could rent it for less
at a video store, and there probably IS a limit to the number of copies
of "Buffy the Vampire Slayer" that anyone could possibly want.
It's a pointless application of cryptography that someone hacked
'because it was there.' It may have insulted them but it didn't hurt
them.
The media industry has been paranoid about copying, and equally wrong
about it, ever since they complained about the emergence of radio for
fear that people would simply tape-record songs off the air!!
>Arnaud Guillon wrote:
>
> As an addition to your post, there is another program named DODSRIP which
> does the same stuff, under DOS prompt though.
>
> lots of these utils could be found at www.dvdutils.com but I think they
> recently had to remove them after intervention from the big multimedia
> companies.
>
> This sites and other similar sites include interesting instructions as to
> how to encode DVD to MPEG1 format. I have tried it using a package called
> DVD2MPEG and it does indeed work very well.
>
========================================================================
Sundial Services :: Scottsdale, AZ (USA) :: (480) 946-8259
mailto:[EMAIL PROTECTED] (PGP public key available.)
> Got Paradox/Delphi database headaches? ChimneySweep{tm} can help, FAST!
> http://www.sundialservices.com/cs3web.htm
------------------------------
From: [EMAIL PROTECTED]
Subject: exchanging tips on code book
Date: Sun, 21 Nov 1999 15:54:46 GMT
Hello. I've successfully cracked #1 #2 #4 challenges cyphers (pretty
simple), on the ITALIAN version of the book (maybe different, maybe
not). I am stuck on #3. I'd like to exchange tips (not solutions). If
anyone wants to do it, please write to me at [EMAIL PROTECTED] I will
consider only tips on decyphering #3, and give tips on #1,2,4.
Please: write only if interested on learning, not on stealing.
Please: do not flame this post, just kindly ignore it if you do not
like it.
many many thanks.
Claudia.
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: [EMAIL PROTECTED]
Crossposted-To: comp.ai.fuzzy,sci.physics,sci.math
Subject: Filters, Superpositions and Entanglements
Date: Sun, 21 Nov 1999 16:01:25 GMT
Superpositions are not necessarily entanglements.
A superposition is what happens at a beam splitter.
An entanglement is what happens in a non-linear crystal.
Zeilinger et al, don't use beamsplitters to make entangled
particle pairs. Superpositions and entanglements are different.
Wavefunction collapse can be alot like tapping a computer
programmer on the shoulder while s/he is in deep superposition
of many associated concepts; destoying their concentration.
Decoherence is a loss of the ability to
make meaningful distinguishments, or the loss of the ability
to maintain a record of a past event (entanglement) and
this diffusion or dispersion does not destroy all record
of the past event but makes it increasingly unrecoverable
in a theromdynamic sense, which itself can probably be modelled
as a damping in an impulse-response (Green's functions) sense,
like a pair of bells having clanged against each other
and that ringing of each bell, as a fading correlated
memory of the past as the energy of the event disperses
within the bell.
Single-moded spatio-temporal solitons (transform
invariant light-bullets)
are recognized for their ability to resist such dispersion
and are proposed for this reason as candidates for qubits
which resist decoherence. Other possibilities for
decoherence resistent qubits might be B-E condensates,
superconductors, and superfluids, and extremely stabilized
laser-light (non-interaction experiments); all of which
effectively seem to homogenize their component units to the
point where they act in extreme unison (coherence).
Pure coherence, unadulterated, is theoretically not possible
in any finitely bounded system. But we none-the-less have
computers, which function almost completely as if this
idealism of both continuity and closure were attainable in a
finite system.
The Zen master will tap the meditating student on the shoulder
to remind him that closures are indeed just as much a part of
life as coherence. Decisions have to be made.
An electric battery represents distinguishment. Its potential
energy is meaningless without continuity (a circuit).
But shorting out the terminals of the battery and explosively
releasing all its energy is also meaningless.
We build an electric circuit with resistance (decoherence) and
yet it can still have meaning, but that meaning is (as Stephan
minds me) is generally derived from outside the energy
economy of that circuit.
The battery's energy is eventually depleted and it fails
to serve its purpose to make some form of distinguishment.
In order for its purpose to survive, the energy must
be replenished from the outside, but not with excessive
greed (we live off the land and should respect the Time
it takes to feed us and itself).
Decoherence is not without distinguishment.
We use circuits with large resistances as "space heaters"
and from this we derive a distinguishment or contrast of
heat and cold on those cold winter nights, but as with
anything else, the 'burning of space' (or land like the rainforests)
is not without its consequences.
Contrast is as important as brightness, but these two
are not the same.
I like the idea of portraying this in terms of ideal mirrors,
which reflect all the colors in a specific direction (Snell),
as opposed to white paper which also reflects all the colors
equally, though not with specific direction (diffuse). Is the
mirror, when crushed into many pieces, the same as the white
paper ?
The mirror appears gray because it is really black in the
regions where light is not reflected. And black and white
and grey seem merely distinguished by _relative_ brightness.
---
"Superpositions" are distinguished from "filters" by their
ability to add as well as subtract. Filters only subtract.
When two systems are superposed and then separated, their
former superposition becomes an entanglement.
A filter can exist without a superposition. First comes space.
As in "spatial filters" in holography.
A superposition cannot exist without the concept of a filter
(in terms of destructive interference). Then comes time.
As in non-spatial filters in holography (filtering in the
time-like domain using convolution instead of multiplication
of the impulse response and signal in the space-like domain)
Entanglement cannot exist without superpositions and filters.
Then comes space-time. As in the more recent quadrature mirror
"filters" or wavelets analysis, .... (Indeed it should be called
"analysis" as it is very similar to what a psychoanalyst
does in terms of a patient's _subjective_ spatio-temporal
memories. The analyst essentially unravels the [en]tangled
threads of space-time in a patient's memories (historical
threads) and reweaves them into a more "flat" or "euclidean"
road map. Similarly, the entangled space-time histories
are unravelled in a _physical_ signal by multi-resolution
analysis of both it's static (deterministic) and dynamic
(non-deterministic) content.)
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: [EMAIL PROTECTED] (Sean A. Walberg)
Subject: Re: Nova program on cryptanalysis -- also cipher contest
Reply-To: [EMAIL PROTECTED]
Date: Sun, 21 Nov 1999 16:15:06 GMT
On Sun, 21 Nov 1999 09:55:28 GMT, [EMAIL PROTECTED]
(Troed) wrote:
>I work as a professional software engineer, so the actual coding part
>is no problem. I'm more interested in actual Playfair rules that can
>be used to go from bigram guesses (or statistics) to a partly
>reconstructed square :)
The army manual on cryptoanalysis is fairly good on this topic.
(pages 7-13 to 7-18). It is available off the net.
Here is what I am doing:
Define some strings that we know are in the plaintext -- STOP,
BEWAREICEWEASELS, etc. Substitute in each one in each possible place.
Right off the hop you can eliminate a lot for breaking rules of
Playfair, ie plaintext equalling cyphertext, no one to one mapping of
plain and cyphertext.
However this produces way too many outputs. What I'd like to do is
try to build squares out of the guesses, and hope that I can break
more rules there to eliminate more guesses. The only way I can see it
though, is to do every combination. For the rectangular rule, this
generates 8 possibilities each digram. For the row and column rules,
it adds 15 each. So far, I'm able to pull out about 5 or so
possibilities, so I'm looking at storing several thousand tries in
memory, though I expect a lot to be eliminated each time a new digraph
is entered. If, after adding all the suspected digraphs, any squares
remain, it can be listed as a possibility.
Sean
---
Sean Walberg <sean at ertw dot com>
------------------------------
From: William Rowden <[EMAIL PROTECTED]>
Subject: Have some hints. Re: Nova program on cryptanalysis -- also cipher contest
Date: Sun, 21 Nov 1999 16:35:35 GMT
In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] wrote:
> I work as a professional software engineer, so the actual coding part
> is no problem. I'm more interested in actual Playfair rules that can
> be used to go from bigram guesses (or statistics) to a partly
> reconstructed square :)
My scripts use one input besides the ciphertext itself: known (or
probable) plaintext. Playfair ciphers for hand solution will almost
always have some crib.
The Playfair square will never encipher a character as itself.
Consequently, one can use the same approach as for the Enigma, as shown
on the Nova program. My script slides the probable plaintext along the
ciphertext until no letters match. (For efficient implementation there
are at least two additional considerations: repeated and reversed
bigrams, and the fact that each letter can correspond to at most five
other letters.) Then my script generates all possible squares for that
location, and slides to the next.
For the contest cipher, the first few plaintext-ciphertext bigram pairs
in each position produced many alternative Playfair squares, but by the
fourth or so bigram pair the number of simultaneous alternatives
dropped, usually to zero. Obviously a long tip is helpful. In the end,
only one of the probable phrases worked in only one location in the
ciphertext. For that location, only four Playfair squares were possible
(ignoring row and column rotations, which do not change the actual
enciphering and deciphering).
I could post pseudocode or--after cleaning it up--my script if this is
not enough detail.
--
-William
SPAM filtered; damages claimed for UCE according to RCW19.86
PGP key: http://www.eskimo.com/~rowdenw/pgp/rowdenw.asc until 2000-08-01
Fingerprint: FB4B E2CD 25AF 95E5 ADBB DA28 379D 47DB 599E 0B1A
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
** FOR YOUR REFERENCE **
The service address, to which questions about the list itself and requests
to be added to or deleted from it should be directed, is:
Internet: [EMAIL PROTECTED]
You can send mail to the entire list (and sci.crypt) via:
Internet: [EMAIL PROTECTED]
End of Cryptography-Digest Digest
******************************
