There is the concept of Kolomogorov complexity, the size of the
smallest algorithm that can generate the message. A perfectly
compressed message would have Kolomogorov complexity
equal to itself.
Kolomogorov complexity does have a freedom in its definition,
but the exciting thing is that any two
The Baltimore Sun has a long article on an abandoned NSA listening
spot in the hills of North Carolina. Some radio astronomers wrangled
control of it so it won't go to waste.
http://www.sunspot.net/content/cover/story?section=cover&pagename=story&storyid=1150520223288
--
-BEGIN PGP SIGNED MESSAGE-
***Please circulate to all interested parties***
This is to announce the Cypherpunks-India mailing list. The list is
for cypherpunks in India, and for those who want to track the
convergence of cryptography, politics and society here.
As you know, I volunteere
At 02:42 PM 1/3/01 +0100, Jaap-Henk Hoepman wrote:
>On Tue, 02 Jan 2001 12:03:40 -0800 David Honig <[EMAIL PROTECTED]> writes:
>> At 10:27 PM 1/1/01 +0530, Udhay Shankar N wrote:
>> >Did this slip between the cracks in holiday season or has it already been
>> >discussed here ?
>>
>> Its just yet
I have a problem. I'm using PGPfreeware 6.5.8 (the one that fixes the ADK
bug) under Windoze and it barfs everytime it's asked to verify a GPG
signature. I don't remember this from earlier versions - what gives ?
Udhay
--
((Udhay Shankar N)) ((udhay @ pobox.com)) ((www.digeratus.com))
Go
Single DES is obviously a mistake - the "24 hours/$200K"
limit is so closely what it took to crack DES,
using either the EFF's ~$250K cracker or
Distributed.net's internet-based crack,
that it's clearly referring to DES.
Back when DES was _designed_, it was computationally
secure, for values of "
Anonymous wrote (responding to the idea of "perfect compression"):
> ... Once you have specified
> such a probability distribution, you can evaluate how well a particular
> compression algorithm works. But speaking of absolute compression or
> absolute entropy is meaningless.
These ideas have o
