|
|
 Up |
|
|
  |
Author: Joseph AshwoodJoseph Ashwood
Date: Dec 16, 2006 17:54
"Thomas Pornin" nerim.net> wrote in message
news:4584181c$0$13203$426a74cc@news.free.fr...>> "Joseph Ashwood" msn.com> writes:>>> Interestingly, Java's BigInteger implementation has a very similar
>>> problem.
>>
>> It uses the OpenSSL modexp implementation.
>
> Let's be accurate. Java is a specification and there are several vendors
> which provide virtual machines. The Java virtual machines provided by
> Sun and IBM since 2000 use a pure Java implementation of BigInteger,
> which is completely unrelated to OpenSSL. I assume you are talking about
> older virtual machines such as the one which was bundled in Microsoft
> Internet Explorer until Microsoft removed it, which happened some time
> around 2002 if I recall...
|
| Show full article (1.54Kb) |
|
| |
no comments
|
|
|
Author: Bodo MoellerBodo Moeller
Date: Dec 16, 2006 17:06
> On 15 Dec 2006 05:13:04 -0800, BenL links.org> wrote:>> Peter Pearson wrote:
>>> . . . I tried
>>> to use it anyway, and within one day had encountered a bug. I
>>> then looked for a way to report the bug, but gave up before
>>> finding anybody who cared.
> A valid jibe at my lack of commitment to the cause. In my
> (admittedly feeble) defense, if http://www.openssl.org/support/
> had said, "Email bug reports to X", I would have. Faced
> instead with a choice of OpenSSL mailing lists to join, and
> recognizing that my romance with OpenSSL was not headed for
> the altar, I satisfied myself with a posting to sci.crypt,
> which got no response, and then I wandered away.
|
| Show full article (1.51Kb) |
|
| |
no comments
|
|
|
Author: Wei DaiWei Dai
Date: Dec 16, 2006 16:46
> Is this scheme still unbroken? I find the arguments by the authors
> rather unconvincing.
> If nothing has been published so far, I'll go over my notes and check
> if something
> substantial can be found.
It's still unbroken, at least according to this recent review:
http://eprint.iacr.org/2006/162
A Summary of McEliece-Type Cryptosystems and their Security
D. Engelbert, R. Overbeck and A. Schmidt
I also didn't find any attacks using a search of Google Scholar.
And to partially answer my own question, apparently the correct terminology
for what I'm looking for is "covering radius". I'm now searching the
literature with the right term...
|
| |
|
no comments
|
|
|
Author: David A MolnarDavid A Molnar
Date: Dec 16, 2006 16:32
Simon Johnson gmail.com> wrote:
> It is happening and sick bastards are phoning his house asking for the
> stuff he's purported to be selling.
> Frankly, whoever is doing this is a really sick bastard and it is
> totally unjustified.
This is terrible, terrible news. Thank you for making us aware of
what's going on
-- and I hope the people responsible can be found
and stopped as soon as possible.
|
| |
|
no comments
|
|
|
Author: Thomas PorninThomas Pornin
Date: Dec 16, 2006 08:00
> "Joseph Ashwood" msn.com> writes:>> Interestingly, Java's BigInteger implementation has a very similar problem.
>
> It uses the OpenSSL modexp implementation.
Let's be accurate. Java is a specification and there are several vendors
which provide virtual machines. The Java virtual machines provided by
Sun and IBM since 2000 use a pure Java implementation of BigInteger,
which is completely unrelated to OpenSSL. I assume you are talking about
older virtual machines such as the one which was bundled in Microsoft
Internet Explorer until Microsoft removed it, which happened some time
around 2002 if I recall correctly.
--Thomas Pornin
|
| |
|
3 Comments |
|
|
Author: Neil W.Neil W.
Date: Dec 16, 2006 05:25
I have been using the Outerbridge des.c source code in some old DOS programs
successfully for some time. However, I recently tried using on on AIX
(bigendian) and it fell apart. Does anything special need to be done in
terms of defines or code? For example do the values in SP1, SP2, SP3, etc,
need to be recast as bigendian values? Many thanks for any guidance.
|
| |
|
1 Comment |
|
|
|
|
|
Author: bongomongobongomongo
Date: Dec 16, 2006 01:59
> But does this act better than the rho method?
Point multiplication on y^2=x^2+ax+b gives the same result for all b.
For some b [x0,y0] is really on the curve.
|
| |
|
no comments
|
|
|
|
|
