ExplicitN-polynomials of 2-power degree over finite fields, I-Reference-Cited by-同舟云学术

ExplicitN-polynomials of 2-power degree over finite fields, I

Published:1995-09 Issue:2 Volume:6 Page:107-116
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des Codes Crypt

Author:

Meyn Helmut

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/BF01398009.pdf

Reference14 articles.

1. I. F. Blake, S. Gao, and R. C. Mullin, Specific irreducible polynomials with linearly independent roots over finite fields,Linear Algebra and its Applications, (submitted) (1993).

2. Contemporary Mathematics;J. V. Brawley,1989

3. S. D. Cohen, The explicit construction of irreducible polynomials over finite fields,Designs, Codes and Cryptography, Vol. 2 (1992) pp. 169?174.

4. S. Gao (1993).Normal Bases over Finite Fields, Ph.D. Thesis, Waterloo.

5. H. W. Lenstra, Jr. and R. J. Schoof, Primitive normal bases for finite fields,Mathematics of Computation, Vol. 48, No. 177 (1987) pp. 217?231.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Iterative constructions of irreducible polynomials from isogenies;Finite Fields and Their Applications;2024-08

2. Constructing irreducible polynomials recursively with a reverse composition method;Designs, Codes and Cryptography;2023-08-04

3. High order elements in finite fields arising from recursive towers;Designs, Codes and Cryptography;2022-04-21

4. High order elements in finite fields arising from recursive towers;DESIGN CODE CRYPTOGR;2022

5. Recursive construction of normal polynomials over finite fields;Journal of Discrete Mathematical Sciences and Cryptography;2021-08-03