moderator@sci.crypt writes:
[SNIP - spam bullcrap]

Still posting through the same anonymiser, I see?

Path: .*POSTED!53ab2750!not-for-mail

Don't you get moral pangs from being such a waste of biomass?

Phil

In the paper "Note on Integer Factoring Methods I", dated
February 2006, but published today

http://arxiv.org/pdf/math.NT/0611203

one can read, "the new formula", refering to the formula #15, page 11.

To the author (I ask you there since there is no e-mail address in
your paper [*]): What do you call a "new formula"?

[*] If ever you were not reading this post, don't answer :)

mm

Hi All,

I'm currently working on a project which will expose students to ECC.
We want the students to break an ECC system (i.e., finding the scalar k
of W=kG over curve E). However, we can't throw a 160 bit NIST curve at
them.

What I'd like to know:

1) What is a good ('average') curve size? Base it on a typical PC -
1.5GHz Pentium. I'd like an average of 150-200 hours to break (one
computer-week or a small fraction of a MIPS year?). My first thought is
to try a few curves in the 50 - 80 bits (preferably over GF(p)).

2) Where is a good basic reference on curve parameter selections? For
example, chose a 60 bit curve. What would be good selections for a and
b without hitting a degenerate case?

3) Is there an 'equivalency' below 160 bits? For example, I have read
160 bit ECC ~= 1024 bit RSA. If the equivalency is valid below 160
bits, is it linear in nature?

I have designed and implemented a new cryptographic algorithm named
"Prime Shuffle".

Abstract:

Linear congruential generators (LCGs) represent one of the oldest and
bestknown pseudorandom number generator algorithms. Prime Shuffle (PS)
creates a bijective function to shuffle bits or bytes of given...

I have designed and implemented a new cryptographic algorithm named
"Prime Shuffle".

Abstract:

Linear congruential generators (LCGs) represent one of the oldest and
bestknown
pseudorandom number generator algorithms. Prime Shuffle (PS) creates
a bijective function to shuffle bits or bytes of given...