sci.crypt
  Home FAQ Contact Sign in
sci.crypt only
 
Advanced search
December 2006
motuwethfrsasuw
    123 48
45678910 49
11121314151617 50
18192021222324 51
25262728293031 52
2006
 Jan   Feb   Mar   Apr 
 May   Jun   Jul   Aug 
 Sep   Oct   Nov   Dec 
2008 2007 2006  
total
sci.crypt Profile…
RELATED GROUPS

POPULAR GROUPS

more...

 Up
  Using Miracl under the Linux environment         


Author: Samson
Date: Dec 17, 2006 23:23

Hello, every one.

I met some trouble when I make a program using Miracl under the Linux
evironment. To be honest, I am not familiar with Linux. I wrote an
algorthm named app.cpp. In the file app.cpp I used the functions such
as mr_init_threading(), mr_free(), etc., provided by Miracl. I can
compile the program like this g++ -I. -c -O2 app.cpp there's no
problem. But, when I try to turn it into an executive program, there
are many "undefined reference"errors. I use the order like this: g++ -I
app.cpp ecn.o zzn.o big.o miracl.a -o app. anybody who has the
experience using the miracl under linux please do me a favour. Thanks a
lot!
2 Comments
  Re: AES code in Sparc assember         


Author: Casper H.S. Dik
Date: Dec 17, 2006 02:18

David Taylor yadt.co.uk> writes:
>With gcc you can tell it to produce assembler. Alternatively, compile
>to object code and disassemble.
>Of course, it probably won't be as efficient as painstakingly hand-tuned
>assembler.

Especially when you use gcc which does not produce very efficient SPARC
code. The (free) Sun compilers generally generate much better SPARC
code (assemly with the -S switch). The latest compilers even produce
some comments as to what they did and why.

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.
no comments
  Re: So, what is it about OpenSSL and sci.crypt?         


Author: Joseph Ashwood
Date: Dec 16, 2006 17:54

"Thomas Pornin" nerim.net> wrote in message
news:4584181c$0$13203$426a74cc@news.free.fr...
> According to Paul Rubin <http://phr.cx@NOSPAM.invalid>:
>> "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
  Re: So, what is it about OpenSSL and sci.crypt?         


Author: Bodo Moeller
Date: Dec 16, 2006 17:06

Peter Pearson :
> 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.
>> Yeah, coz its so hard to find http://www.openssl.org/support/.
> 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
  Re: covering radius (was "maximum distance") of a Goppa code?         


Author: Wei Dai
Date: Dec 16, 2006 16:46

"daniel bleichenbacher" yahoo.com> wrote in message
news:1166306953.936414.265810@l12g2000cwl.googlegroups.com...
> 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
  Re: Seen Tom St Denis latly?         


Author: David 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
  Re: So, what is it about OpenSSL and sci.crypt?         


Author: Thomas Pornin
Date: Dec 16, 2006 08:00

According to Paul Rubin <http://phr.cx@NOSPAM.invalid>:
> "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
  Outerbridge des.c on AIX (bigendian)         


Author: 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
  Re: Elliptic curve factoring with points *NOT* on the curve         


Author: bongomongo
Date: Dec 16, 2006 01:59

ttw@texasairnet.com wrote:
> 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
  Re: Edible One-Time Pad books         


Author: Unruh
Date: Dec 15, 2006 23:11

admin@eatmychat.com writes:
>Ernest Hammingweight wrote:
>> Unruh wrote:
>>> These estimates are, shall we say, not worth much. I just set up a file
>>> with 100 copies of the 512 byte string
>>> 0 255 1 254 2 253 ......254 0...
Show full article (3.33Kb)
no comments
1 2 3 4 5 6