Just a reminder that there's still a bug in the communication with the
experimental package CryptoMiniSat 5.0.1 when used via the function
sage.sat.boolean_polynomials.solve().
In the following example no solution of the boolean equation system is not
found:
varl = ['k{0}'.format(p) for p in range(29)]
B = BooleanPolynomialRing(names = varl)
B.inject_variables(verbose=False)
keqs = [
k0 + k6 + 1,
k3 + k9 + 1,
k5*k18 + k6*k18 + k7*k16 + k7*k10,
k9*k17 + k8*k24 + k11*k17,
k1*k13 + k1*k15 + k2*k12 + k3*k15 + k4*k14,
k5*k18 + k6*k16 + k7*k18,
k3 + k26,
k0 + k19,
k9 + k28,
k11 + k20]
from sage.sat.boolean_polynomials import solve as solve_sat
kpsol = solve_sat(keqs, n=1)
print type(kpsol)
print len(kpsol)
Changing the first statement to
varl = ['k{0}'.format(p) for p in range(28, -1, -1)]
which just re-orders the generators, a solution can be found.
Any ideas?
Jörg-Volker.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
