Ask Your Question
1

Order of randomly generated elliptic curve

asked 2012-06-01 05:19:39 +0200

twoforone gravatar image

updated 2015-01-18 11:32:38 +0200

FrédéricC gravatar image

I was computing order of random elliptic curves over prime field with out any problem. But when it comes to computing order of elliptic curves over binary field(characteristic 2 field), it computes well for small values of a and b of the elliptic curve. The problem comes when a and b parameters are large, specifically for 163 bit elliptic curve parameters. I can generate random point of the elliptic curve of 163 bits. However, when I compute its order, it displays exhaust memory and then it exits and some times Jim dead message is displayed.

I could not understand the problem. Could you say something for me regarding this problem? Thank you in advance.

edit retag flag offensive close merge delete

Comments

Can you post a sequence of commands that exhibits the problem?

Volker Braun gravatar imageVolker Braun ( 2012-06-02 17:05:32 +0200 )edit

1 Answer

Sort by » oldest newest most voted
2

answered 2013-12-10 05:48:54 +0200

John Cremona gravatar image

Sage is not magic. If no-one has implemented a procedure for computing orders of curves over such large binary fields, then it will revert to using a generaic procedure, and that will not work in reasonable time.

I think that the documentation does say something about this: apart from prime fields, where Sage uses a pretty good SEA implementation from PARI, the point-counting abilities are definitely not good enough for fields of cryptographic interest.

Feel free to contribute something better!

edit flag offensive delete link more

Comments

nbruin gravatar imagenbruin ( 2013-12-12 16:39:14 +0200 )edit

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

Stats

Asked: 2012-06-01 05:19:39 +0200

Seen: 295 times

Last updated: Dec 10 '13