Re: Elliptic curves

On Aug 6, 5:59 am, mm <nowhere@net> wrote:
a écrit :

mm  <nowhere@net> wrote:
But I was not writing a math paper, [...]

Correctness still matters.

Like telling me that we cannot use ECs to mimic RSA because computing
"e'th roots (at least for small e) on an elliptic curve over a finite
field" is easy?

Yes. That is what he is telling you. And he is correct.

In short, you do not even know what I am thinking of

I doubt whether you are capable of thinking at all.

but that's not what can prevent you to explain me why it cannot work!

This sentence is gibberish.

Correctness still matters... :-)

The only goal of my post to E. Söylemez was that we can make RSA with
ECs because we need a group, not a ring.

And the only point of the reply was to indicate that you are totally
WRONG.
RSA works because the exponentiation is done in a group of UNKNOWN
ORDER.

For EC, once you have the coefficients of the curve, and have
specified the finite
field, the group order becomes KNOWN. Computing it is easy.

You CAN NOT make an RSA encryption scheme using elliptic curves.

Now, maybe I should have
written "a group with the good properties",

And if you had done so, you would have been writing GIBBERISH.
And you would still be wrong.

it would have been
sufficiently fuzzy to avoid misplaced comma hunters.

Unfortunately, you do not seem to understand that exactness is
NECESSARY.

I suggest that you quit while you are behind.
.

Relevant Pages

• Re: Fundimentals of Elliptic Curves for a newbe
... >>better than traditional RSA. ... one cannot in general count points on elliptic curves modulo ... So one can, in a certain sense, do RSA on an elliptic curve modulo ... a composite number. ...
(sci.crypt)
• Re: Efficent Digital Signature Schemes.....
... security of 512-bit RSA, why not just use RSA with a public exponent ... (google "elliptic curve digital signature" for a lot of links). ... or DSA while seeming to offer comparable security (based on ...
(sci.crypt)
• Re: Efficient asymmetric encryption (Newbie)
... and computing ki = H). ... For a large stream of data, RSA is too slow. ... 7000 times slower than AES, ... AES takes about 300 cycles per block. ...
(sci.crypt)
• Re: Efficient asymmetric encryption (Newbie)
... and computing ki = H). ... For a large stream of data, RSA is too slow. ... evolution using a reasonable hash function H. ... The computer then encrypts mi using ki." ...
(sci.crypt)