I suggest that readers of this forum who are able to do it should help by
exposing the perpetrator.

JR

"David Wagner" taverner.cs.berkeley.edu> wrote in message
news:els961$ukn$1@agate.berkeley.edu...

admin@eatmychat.com writes:

Goldwasser-Micali public-key key generation picks two (large) primes
p and q, and an integer x such that x is not a square mod p (i.e., not a
quadratic residue) and not a square mod q. The public key is (x, N),
where N=p*q. The private key is (p, q).
A GM ciphertext is the value of (r**2)*(x**m) mod N, where r is
random and the message m is either 0 or 1.
The private key holder recovers m by determining whether the
ciphertext is a square mod p and a square mod q (It better be both or
neither.).

Simon Johnson wrote:

That's atrocious and disgusting. I second everything Jean-Luc Cooke
and Simon Johnson wrote. Whoever is doing this to Tom St Denis, it's
despicable. I hope that the perpetrators are caught. Best wishes to Tom
St Denis; I hope he'll be able to weather this storm and re-join us soon.

clark wrote:

Joseph Ashwood wrote:

Hmmm, curious --- I've somehow consistently have been drawn back to
OpenSSL as the "only" alternative; with LibTomCrypt (which I hear
about often enough), I get that ugly feeling that "ughh, but it's
in C; if I'm going to be tortured into using C, I might as well
stick to the ugly-but-ubiqutous OpenSSL" (that is, write my own
wrapper functions or classes and be done with it).

So, of course, I want C++, so what better than Crypto++??? Well,
it does not seem to work (read: compile) on any platform that I use;
frankly, I get from them the frustrating feeling that the library
only compiles with the latest version of Microsoft compilers on
Windows :-( (I know that this is not the case; this is another
instance of a "semi-comical exaggeration").

I have course notes on error detecting and correcting codes that
state the following two well known facts:

Fact 1:
"A block-code can detect s errors if and only if d >= s+1"

Fact 2:
"A block-code can correct t errors if and only if d >= 2t+1"

where d is the distance of the code.

Now a little bit further in these course notes, it is written:

"In general, a code can only detect errors or only correct errors
or a combination of both. The requirement for a code to be able
to detect s errors and at the same time correct t (<=s) errors is
that d>=s+t+1

Example:
Suppose we have a code with d=5. This code can...
... detect 4 errors and correct 0 errors.
OR ... detect 3 errors and correct 1 error.
OR ... detect 2 errors and correct 2 errors."