Timeline for Finding an embedding efficiently in field extension of finite field
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 4, 2011 at 7:50 | vote | accept | tckwok | ||
| Oct 3, 2011 at 20:48 | comment | added | Jyrki Lahtonen | Remember that you will only find the element 'up to conjugacy'. A trick researchers in finite fields often use is to use a primitive polynomial to generate the bigger field. Then you can pick the relative norm of that generator as a generator for the smaller field. That makes it easy to, e.g. align multiplicative characters. This doesn't answer your question because then the lower degree primitive polynomial will be determined (shouldn't be too hard to compute either). May be that route is not open to you? | |
| Oct 3, 2011 at 11:00 | answer | added | Felipe Voloch | timeline score: 3 | |
| Oct 3, 2011 at 10:37 | history | asked | tckwok | CC BY-SA 3.0 |