共 50 条
- [22] Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2)1 [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 37 (02): : 267 - 282
- [26] NUMBER OF IRREDUCIBLE POLYNOMIALS OF DEGREE N OVER GF(P) [J]. AMERICAN MATHEMATICAL MONTHLY, 1970, 77 (07): : 743 - &
- [27] A Random Key Generation Scheme Using Primitive Polynomials over GF(2) [J]. SECURITY IN COMPUTING AND COMMUNICATIONS, SSCC 2016, 2016, 625 : 42 - 51
- [28] Reverse Engineering of Irreducible Polynomials in GF(2m) Arithmetic [J]. PROCEEDINGS OF THE 2017 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2017, : 1558 - 1563
- [30] GENERATION OF IRREDUCIBLE POLYNOMIALS OVER A FINITE FIELD [J]. AMERICAN MATHEMATICAL MONTHLY, 1965, 72 (06): : 646 - &