Monapp's profile - activity

On the same topic, is it possible to do Shortened Reed-Solomon codes?

Duplicated RM codes Hey, Can we do duplicated Reed-Muller codes in sagemath as used in HQC? I saw the sage documentati

Duplicated RM codes Hey, Can we do duplicated Reed-Muller codes in sagemath as used in HQC? I saw the sage documentati

Hey, I was wondering how can sagemath can calculate gcds without calculating the numbers at stake? For instance,

sage: from Crypto.Util.number import long_to_bytes, inverse, bytes_to_long
sage: from Crypto.Hash import SHA256
sage: e = 65537
sage: gcd(bytes_to_long(SHA256.new(data=b'first').digest())^e-35211653423, bytes_to_long(SHA256.new(data=b'second').digest())^e-156535482153)

is computed nearly instantly while it will take forever for sage to calculate bytes_to_long(SHA256.new(data=b'first').digest())^e.

Is it perhaps part of symbolic computation?

Thanks :)

Where does sagemath's speed in calculating gcd come from? Hey, I was wondering how can sagemath can calculate gcds witho

Where come from the speed of sagemath for the gcd function? Hey, I was wondering how can sagemath can calculate gcds wit

Where come from the speed of sagemath for the gcd function? Hey, I was wondering how can sagemath can calculate gcds wit

It seems that p.sylvester_matrix(h,y).determinant() works, should it be pointed out in a git issue?

Oh, thanks for the comment. Maybe I should point out the unclear error with an issue git 🤔

p.resultant(...) returning a TypeError: Singular error: Hello, I use sage version 10.1 with Python 3.11.5 and defining