ASKSAGE: Sage Q&A Forum - Latest question feedhttp://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Tue, 27 Nov 2018 21:24:16 -0600generate random elliptic curve of prime orderhttp://ask.sagemath.org/question/44480/generate-random-elliptic-curve-of-prime-order/As required in many cryptographic algorithms, I would like to sample a group (in this case, an abelian group defined on elliptic curve) of a random prime order. I know how to define an elliptic curve with given parameters, and then calculate its order. But how to sample an elliptic curve of random prime order?pantherTue, 27 Nov 2018 21:24:16 -0600http://ask.sagemath.org/question/44480/Early abort for E.cardinality()http://ask.sagemath.org/question/33943/early-abort-for-ecardinality/I loop through curves to find one with prime cardinality. In order to speed up the process, it would be convenient to have early abort option, so that whenever some prime factor of cardinality is found, the algorithm skips that curve and goes to the next one. Any suggestions how this can be done?VovaMon, 27 Jun 2016 14:38:02 -0500http://ask.sagemath.org/question/33943/Why was sea.py removed?http://ask.sagemath.org/question/33968/why-was-seapy-removed/ I noticed that sea.py
[link text](https://trac.sagemath.org/attachment/ticket/10001/10001_remove_sea.patch)
has been removed. I need the cardinality function for elliptic curves with early abort option, however, it does not seem to be available. Any suggestions what could be done here?VovaWed, 29 Jun 2016 13:10:45 -0500http://ask.sagemath.org/question/33968/Error with .cardinality(algorithm='sae') for elliptic curvehttp://ask.sagemath.org/question/26761/error-with-cardinalityalgorithmsae-for-elliptic-curve/Hello please i have a problem. I have already defined an elliptic curve over a ring `Zn` and i want to compute its cardinality but i can not use `.cardinality(algorithm='sae')`. Thank you.
Here is the programme that i want to implement.
def cardin(n,A,B)
Z = Zmod(n) # n is not a prime then Z is a ring
E = EllipticCurve(Z,(A,B))
return E.cardinality(algorithm='sae') "sae=Schoof Atkin"
TypeError: cardinality() got an unexpected keyword argument 'algorithm'kotorakotoFri, 08 May 2015 10:11:39 -0500http://ask.sagemath.org/question/26761/Why the function .cardinality() doesnt work with a permutation group ?http://ask.sagemath.org/question/27127/why-the-function-cardinality-doesnt-work-with-a-permutation-group/ I have acode that use to run very good, but I dont know why no longer the basic functions works for my permutation groups, i.e Abelian, cardinality, order. Only degree seems to workhbanosWed, 17 Jun 2015 01:05:34 -0500http://ask.sagemath.org/question/27127/Error in code or need more runtime?http://ask.sagemath.org/question/25394/error-in-code-or-need-more-runtime/ Hello everyone,
I would like to compute the number of sub-multisets (of a particular cardinality) of a multiset. The "mother" multiset contains exactly 2 copies of the numbers 0 through 52 (it has cardinality 106), and I would like to compute the number of distinct sub-multisets of size 14. I am attempting to do this with Sage (of course), and the code I am trying to use is as follows:
S = range(53); S.extend(range(53))
// This makes my mother set of two copies of the numbers 0 through 52
Hands = Subsets(S, 14, submultiset=true); Hands.cardinality()
// This defines a set of the sub-multisets of size 14, and then outputs their cardinality.
When I run this (in the Sage Notebook running inside Oracle VirtualBox with 2gb of allotted RAM), it gives me a small green rectangle that changes the cursor to a 'watch' as if it's still running. It's been like this for over and hour now. Is there an error in my code or should I expect such a calculation to take a 'long' time? I'm not familiar with 'large' calculations such as this one.
Thanks in advance!mengenSun, 04 Jan 2015 12:16:02 -0600http://ask.sagemath.org/question/25394/