NASA NTRS · 19780020180
A new algorithm for computing primitive elements in GF q square
Abstract
A new method is developed to find primitive elements in the Galois field of sq q elements GF(sqq), where q is a Mersenne prime. Such primitive elements are needed to implement transforms over GF(sq q).
Keep this discovery
Explore connections, maps & timelines
Reed, I. S., Truong, T. K., Miller, R. L.. 1978-06-15. A new algorithm for computing primitive elements in GF q square. https://ntrs.nasa.gov/citations/19780020180
Cite the original work for its findings. Save a collection to share your selection of sources.