#18749: Groebner basis computations with the F4 algorithm
-------------------------------------+-------------------------------------
Reporter: tcoladon | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: packages: | Resolution:
optional | Merged in:
Keywords: F4, groebner | Reviewers:
basis, ideal | Work issues:
Authors: Titouan Coladon | Commit:
Report Upstream: N/A | cf1952a78d21e5778ca358dff120166d184a86c4
Branch: u/malb/t18749_f4 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by frederichan):
Replying to [comment:17 malb]:
> The results over GF(2^8^) seem to be incorrect, though:
>
> {{{#!python
> sage: sr = mq.SR(1,1,1,4,gf2=False) # smallest scale small scale AES
> sage: F,s = sr.polynomial_system()
>
> sage: %time gb = F.groebner_basis()
> CPU times: user 8 ms, sys: 0 ns, total: 8 ms
> Wall time: 6.76 ms
> sage: gb[0]
> k003^2 + (a^2 + a + 1)*k003 + (a^3 + a^2 + 1)
>
> sage: %time gbf4 = F.groebner_basis('f4')
>
>
> GROEBNER BASIS : (1) # this output should not be here
> ---> 0 ms
>
>
> CPU times: user 8 ms, sys: 0 ns, total: 8 ms
> Wall time: 10.9 ms
> sage: gbf4 == gb # the output disagrees
> False
>
> }}}
It is not clear for me that why gbf4 == gb should be True. I have
nevertheless:
{{{
sage: gbf4==gb,gbf4.is_groebner(), gb.is_groebner()
(False, True, True)
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/18749#comment:20>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
