| 1 | initial version |
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!
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.