Designs Codes and Cryptography · 2011 · 16 citations · 15 references
Computational ComplexityGaussian ProcessTime ComplexityGauss Periods
15
Optimal normal bases in GF(pn)
R. C. Mullin, I. Onyszchuk, Scott A. Vanstone et al. · Discrete Applied Mathematics · 1988 · 326 citations
Shuhong Gao, H. W. Lenstra · Designs Codes and Cryptography · 1992 · 96 citations
Mathematical Programming, Engineering, Optimization Problem +5