To whoever has the same problem in the future,
To solve my problem, I finally used Safe Primes so the procedure of finding
a generator becomes really simpler.
Thanks everyone for your answers.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
T
Hello everyone,
I am trying to calculate a primitive element (g) of a big Finite Field:
GF(p) where p is prime number > 2^2048
So then, i could share a secret integer (r) as: m=g^r, but it seems
impossible to calculate it with function primitive_element()
Is there another way i can use to calcu
Thanks Johan,
I finally implement the decoder using lattice basis reduction (using LLL)
The only thing left is to reduce the execution time of the decoder by
finding the most efficient way to locate the errors via the error locator
poynomial (something better than chien search)
If you are inter
Hello,
I am trying to implement Patterson's Algorithm for decoding Goppa codes.
I am stuck in the part that I have to find two polynomials a(x) and b(x) so
that a(x)=b(x)R(x)mod(g(x))
where g(x) is the goppa poly and deg(a(x)) must be <= t/2.
I know that i have to use extended Euclidean Algorith
