Since trac #28426 (merged pretty recently), when building with Python 3, we
do not build Python 2. Before that, we always built both.
On Sunday, November 3, 2019 at 12:57:02 PM UTC-8, Dima Pasechnik wrote:
>
> I am surprised we still even build python2 by default. Isn't it an
> optional
I am surprised we still even build python2 by default. Isn't it an optional
package?
On Sun, 3 Nov 2019, 20:52 Simon King, wrote:
> Hi Dima,
>
> On 2019-11-02, Dima Pasechnik wrote:
> > There "python" is Sage's Python, "pip" manages its modules, etc.
>
> IIRC, that's not true for Sage's py-3
Hi Dima,
On 2019-11-02, Dima Pasechnik wrote:
> There "python" is Sage's Python, "pip" manages its modules, etc.
IIRC, that's not true for Sage's py-3 version. Namely, if one opens a
sage-with-py-3 shell, then "python" still means "python2". So, if you
really want Sage-with-py-3's Python
One can check that Sage's built-in methods can invert such a GF(2) maytrix
in reasonable time:
sage: MS=MatrixSpace(GF(2),512,512)
sage: while True:
: M=MS.an_element()
: if M.is_unit(): break
:
sage: %time IM=M^-1
CPU times: user 2.99 ms, sys: 243 µs, total: 3.23 ms
Spoke too fast. Sorry for the noise...
Le jeudi 31 octobre 2019 10:51:27 UTC+1, Subrata Nandi a écrit :
>
> My research area is symmetric key cryptology. I need an efficient
> algorithm for solving inverse of symbolic matrix of size 512 x 512 in
> GF(2). Can anyone share
> Idea regarding that?
Well, the standard Sage operatins seem to be able to do what you want:
sage: MS=MatrixSpace(GF(2), 5, 5)
sage: MS
Full MatrixSpace of 5 by 5 dense matrices over Finite Field of size 2
sage: M=MS.random_element();M
[0 0 1 0 1]
[0 0 1 1 0]
[0 0 0 0 1]
[1 1 0 1 0]
[0 1 1 0 0]
sage: M^-1
[0 1 0 1 1]
>From the docstrings:
sage: x.simplify?
Return a simplified version of this symbolic expression.
Note: Currently, this just sends the expression to Maxima and
converts it back to Sage.
See also: "simplify_full()", "simplify_trig()",
"simplify_rational()",
