Abstract
Experimental results on the multiplicative orders of Gauss periods in finite fields are presented. These results indicate that Gauss periods have high order and are often primitive (self-dual) normal elements in finite fields. It is shown that Gauss periods can be exponentiated in quadratic time. An application is an efficient pseudorandom bit generator.
Cite
CITATION STYLE
APA
Gao, S., von zur Gathen, J., & Panario, D. (1998). Gauss periods: orders and cryptographical applications. Mathematics of Computation, 67(221), 343–352. https://doi.org/10.1090/s0025-5718-98-00935-1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free