.
> Best Regards,
> Domingo
>
>
>
> On Oct 26, 7:39 pm, adam mohamed wrote:
> > Hi All,
> >
> > I would like to know if the search for the nearest vector using LLL in
> a
> > lattice over a number field is implemented in Sage. The documentation
> d
Hi All,
I would like to know if the search for the nearest vector using LLL in a
lattice over a number field is implemented in Sage. The documentation does
not say anything about that, unfortunately. Thanks.
Regards,
--
adam
--~--~-~--~~~---~--~~
To post
might also
> look at the GAP reference manual or email the gap support list.
>
>
> On Tue, Oct 20, 2009 at 10:08 AM, adam mohamed
> wrote:
> > For an integer n, it is the sub-module homogeneous polynomials in two
> > variables of degree over a finite field k with the ac
:
>
> Can you describe it as a Meataxe module?
> http://www.gap-system.org/Manuals/doc/htm/ref/CHAP067.htm
>
> On Tue, Oct 20, 2009 at 8:04 AM, adam mohamed
> wrote:
> > It is some polynomial module over a finite field. Thanks for the quick
> > reply.
> >
> &
e, Oct 20, 2009 at 7:32 AM, adam mohamed
> wrote:
> >
> > Hi All,
> >
> > Is it possible to compute the semi-simplification of a module in sage or
> I
> > have to use magma for that? Thanks.
> >
> >
> > --
> > adam
> >
> >
Hi All,
Is it possible to compute the semi-simplification of a module in sage or I
have to use magma for that? Thanks.
--
adam
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Hi,
Thanks. I just solve it.
Best wishes,
Adam
On Mon, Jun 29, 2009 at 11:57 AM, Ahmed Fasih wrote:
>
> Adam, try posting your error message.
>
> On Jun 26, 10:20 am, adam mohamed
> wrote:
> > Dear All,
> >
> > I am having the same problem as the one
Dear All,
I am having the same problem as the one below on a windows machine and I
tried: notebook(open_viewer=False)
in vain. What I should do? Thanks
Adam
On Fri, Jun 26, 2009 at 2:06 PM, William Stein wrote:
>
> On Fri, Jun 26, 2009 at 1:52 PM, Michael wrote:
> >
> > Hello i am just start
13 PM, John Cremona wrote:
> 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
makes me pleased, since I wrote it),
> whether or not the groupis cyclic (which is
> usually is), so it may be that you should first find the generator(s)
> of the group and their orders, and work with that.
>
> John
>
> On Jun 23, 2:17 pm, adam mohamed wrote:
> >
s. Is this doable in Sage now?
Best wishes,
Adam
On Tue, Jun 23, 2009 at 1:14 PM, John Cremona wrote:
>
>
>
> 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
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
12 matches
Mail list logo
