Don't do Groebner bases over SR, use a proper polynomial ring. On Thu, Jul 1, 2021 at 4:56 PM Sam Ratcliffe <[email protected]> wrote: > > I am using the SageMath implementation of SR and wish to recover all > solutions to a polynomial system using the variety function for ideals as > specified here: > https://doc.sagemath.org/html/en/reference/cryptography/sage/crypto/mq/sr.html > > When I run the following (as available on the above link): > > sage: sr = mq.SR(1,1,1,4, gf2=True, polybori=True) > sage: K = sr.base_ring() > sage: a = K.gen() > sage: K = [a] > sage: P = [1] > sage: F,s = sr.polynomial_system(P=P, K=K) > sage: I = F.ideal() > sage: for V in I.variety(): > ....: for k,v in sorted(V.items()): ....: print("{} {}".format(k, v)) > ....: print("\n") > > -- > You received this message because you are subscribed to the Google Groups > "sage-support" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To view this discussion on the web visit > https://groups.google.com/d/msgid/sage-support/535596c4-8138-4894-b7c0-13293904ee30n%40googlegroups.com.
-- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/CAAWYfq3%2BqG%2BBjBVr8hTS-5MWe72O0tTLMKsrpDOMnbWiZR93Tw%40mail.gmail.com.
