| On 8/28/06, Ondrej Mikle <[EMAIL PROTECTED]> wrote:
| > Take as an example group of Z_p* with p prime (in another words: DLP).
| > The triplet (Z, p, generator g) is a compression of a string of p-1
| > numbers, each number about log2(p) bits.
|
| Pardon my mathematical ignorance, but isn't Z ju
On 8/28/06, Ondrej Mikle <[EMAIL PROTECTED]> wrote:
Take as an example group of Z_p* with p prime (in another words: DLP).
The triplet (Z, p, generator g) is a compression of a string of p-1
numbers, each number about log2(p) bits.
Pardon my mathematical ignorance, but isn't Z just a notation t
Dave Korn asked:
> Is it *necessarily* the case that /any/
> polynomial of log N /necessarily/ grows slower than N?
Yes.
Hint: L'Hôpital's rule.
> if P(x)==e^(2x)
That's not a polynomial.
x^Q is a polynomial. Q^x is not.
---
On 8/23/06, Ondrej Mikle <[EMAIL PROTECTED]> wrote:
We discussed with V. Klima about the "recent" bug in PGPdisk that
allowed extraction of key and data without the knowledge of passphrase.
I skimmed the URL and it appears this claim was answered several times
in the original thread. Did you n
On 28 August 2006 17:12, Ondrej Mikle wrote:
> We are both talking about the same thing :-)
Oh!
> I am not saying there is a finite deterministic algorithm to compress
> every string into "small space", there isn't. BTW, thanks for "There
> is ***NO*** way round the counting theory." :-)
>
>
We are both talking about the same thing :-)
I am not saying there is a finite deterministic algorithm to compress
every string into "small space", there isn't. BTW, thanks for "There
is ***NO*** way round the counting theory." :-)
All I wanted to say is:
For a specific structure (e.g. movie, pi
On 28 August 2006 15:30, Ondrej Mikle wrote:
> Ad. compression algorithm: I conjecture there exists an algorithm (not
> necessarily *finite*) that can compress large numbers
> (strings/files/...) into "small" space, more precisely, it can
> compress number that is N bytes long into O(P(log N)) byt
On 8/28/06, Dave Korn <[EMAIL PROTECTED]> wrote:
The author has made the *exact* same error as when someone comes up with a
magical compression algorithm that they say can compress absolutely any data
down to a tiny size. They always get the data to compress, sure, but they
always have problem
On 24 August 2006 03:06, Ondrej Mikle wrote:
> Hello.
>
> We discussed with V. Klima about the "recent" bug in PGPdisk that
> allowed extraction of key and data without the knowledge of passphrase.
> The result is a *very*wild*hypothesis*.
>
> Cf. http://www.safehack.com/Advisory/pgp/PGPcrack.ht
On Thu, 24 Aug 2006, Ondrej Mikle wrote:
> 2) AFAIK, Zimmerman is no longer in control of the company making PGP.
> AFAIK the company (NAI) has been bought by another group couple of years
> ago.
The rescue of PGP from NAI's gross neglect and mismanagement of the
product line was orchestrated by
Hello.
We discussed with V. Klima about the "recent" bug in PGPdisk that
allowed extraction of key and data without the knowledge of passphrase.
The result is a *very*wild*hypothesis*.
Cf. http://www.safehack.com/Advisory/pgp/PGPcrack.html
Question 1: why haven't anybody noticed in three mon
11 matches
Mail list logo
