Dear John,
I was also searching for curves of cofactor one and that's what the first
part was supposed to do, I am sorry I forgot to say it in the previous
post. Anyway I will add some lines and hope that this time things will work
well. Many thanks.
Adam
On Wed, Jun 24, 2009 at 2:13 PM, Jo
On Wed, Jun 24, 2009 at 1:29 PM, adam
mohamed wrote:
>
> I did not know that. I tought that by the line: S = P.division_points(n_1),
> I would get a non-trivial point in that case witouh having to return all the
> points. Can I just chose a non-trivial random point on the curve or what is
> the b
2009/6/24 adam mohamed :
>
> I did not know that. I tought that by the line: S = P.division_points(n_1),
> I would get a non-trivial point in that case witouh having to return all the
> points. Can I just chose a non-trivial random point on the curve or what is
> the best to choose a point without
I did not know that. I tought that by the line: S = P.division_points(n_1),
I would get a non-trivial point in that case witouh having to return all the
points. Can I just chose a non-trivial random point on the curve or what is
the best to choose a point without going on whole of unecessary thing
Here is the problem Adam. You have a prime l which is about 2^165.
You construct random curves over the field GF(l) and count the number
of points n_1 on them. This is possible using Sage's use of an
efficient SEA algorithm. When the number n_1 is prime, you then ask
for all the points of order
A quick look at your output suggest that the division poly code is
getting into an infite recursion -- if so, that would explain running
out of memory. I will look into it.
John Cremona
On Jun 23, 2:17 pm, adam mohamed wrote:
> Hi All,
>
> I solve the problem with the memory, thanks to Willia
Hi All,
I solve the problem with the memory, thanks to William. But, now when I
impose some strict conditions so that I have to toss say 100 times in order
to hope for some curves to pop up, I am getting different kind of errors. I
have attached the code and the error message I got hereby. Maybe
On Jun 22, 7:59 pm, adam mohamed wrote:
> Hi,
>
> Thanks for the very quick response. I will try that tomorrow. Now I
> understand the problem that we met when running the same code in a linux
> machine.
> I am doing this search for cryptographic applications, so I am dealing with
> primes
Hi,
Thanks for the very quick response. I will try that tomorrow. Now I
understand the problem that we met when running the same code in a linux
machine.
I am doing this search for cryptographic applications, so I am dealing with
primes from the size of 170 bit Length.
I would like the 2-sylo
On Mon, Jun 22, 2009 at 5:35 PM, harivola wrote:
>
> Hi all,
>
> I am running a small script on a windows xp machine and some time I
> am getting this error message:
> /usr/local/sage/local/bin/sage-sage: line 348: 19954 Killed
> python "$@"
You're probably running out of memory (=RAM). Try e
10 matches
Mail list logo
