On Wednesday, May 10, 2017 at 11:05:40 AM UTC+1, Panos Phronimos wrote: > > > 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 calculate it? >
Typically, a large proportion (specifically, phi(p-1), for phi() being Euler totient function) of GF(p)* consists of primitive elements. I don't think anything better than picking an element at random and checking its primitivity is known. > > Thanks in advance, > Panos > -- 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 sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
