Irreducible trinomials over finite fields

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 332-336

  Von Zur Gathen, J ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; PROBABILITY; STATISTICAL METHODS; THEOREM PROVING;

MONIC REVERSAL; SQUAREFREENESS; TRINOMIALS;

POLYNOMIALS;

EID: 0034772192     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384146     Document Type: Conference Paper

References (28)

1. On certain trinomial equations in finite fields
2. Ciphertext only reconstruction of stream ciphers based on combination generators
3. Codes, bent functions and permutations suitable for EDS-like cryptosystems
4. Factorization of a special polynomial over a finite field
5. A new approach of some problems concerning polynomials over finite fields
6. On binary cyclic codes with minimum distance d = 3
7. On the minimum distances of non-binary cyclic codes
8. On a theorem of stickelberger
9. q
10. k + 1 irreducible over GF(2)
11. Algorithms for exponentiation in finite fields
12. Exponentiation in finite fields. Theory and practice
13. Exponentiation using addition chains for finite fields
14. On trinomial recurrences
15. Periodic binary sequences with the "Trinomial Property"
16. New families of almost perfect nonlinear power mappings
17. 3
18. Orthogonal arrays, primitive trinomials, and shift-register sequences
19. Contributions to the theory of finite fields
20. Fast key exchange with elliptic curve systems
21. On the irreducibility of certain trinomials
22. Über eine neue Eigenschaft der Diskriminanten algebraischer Zahlkörper
23. Factorization of polynomials over finite fields
24. Factorization of trinomials over galois fields of characteristic 2
25. n + x + 1 over GF(2)
26. On primitive thrinomials (mod 2), II