Twelve New Primitive Binary Trinomials
نویسندگان
چکیده
We exhibit twelve new primitive trinomials over GF(2) of record degrees 42 643 801, 43 112 609, and 74 207 281. In addition we report the first Mersenne exponent not ruled out by Swan’s theorem [10] — namely 57 885 161 — for which none primitive trinomial exists. This completes the search for the currently known Mersenne prime exponents. Primitive trinomials of degree up to 32 582 657 were reported in [5]. We have completed a search for all new Mersenne prime exponents found by the GIMPS project [7]. Twelve new primitive trinomials were found (see Table 1).
منابع مشابه
Ten new primitive binary trinomials
We exhibit ten new primitive trinomials over GF(2) of record degrees 24 036 583, 25 964 951, 30 402 457, and 32 582 657. This completes the search for the currently known Mersenne prime exponents. Primitive trinomials of degree up to 6 972 593 were previously known [4]. We have completed a search for all known Mersenne prime exponents [7]. Ten new primitive trinomials were found. Our results ar...
متن کاملÍòòòóöñ Êêòòóñ Aeùñö Òòööøóö× Òò Èööññøøú Ìööòóñññð×
Generators and Primitive Trinomials Ri hard P. Brent Computing Laboratory University of Oxford rpb omlab.ox.a .uk 1 May 2001 To be presented at OUCL, 1 May 2001. Copyright 2001, R. P. Brent. oxford3t Abstra t In this talk, whi h des ribes joint work with Samuli Larvala and Paul Zimmermann, we onsider the problem of testing trinomials over GF(2) for irredu ibility or primitivity. In parti ular, ...
متن کاملA fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
The standard algorithm for testing reducibility of a trinomial of prime degree r over GF(2) requires 2r + O(1) bits of memory. We describe a new algorithm which requires only 3r/2+O(1) bits of memory and significantly fewer memory references and bit-operations than the standard algorithm. If 2r − 1 is a Mersenne prime, then an irreducible trinomial of degree r is necessarily primitive. We give ...
متن کاملA Fast Algorithm for Testing Irreducibility of Trinomials
The standard algorithm for testing reducibility of a trinomial of prime degree r over GF(2) requires 2r+O(1) bits of memory and Θ(r) bit-operations. We describe an algorithm which requires only 3r/2 + O(1) bits of memory and significantly fewer bit-operations than the standard algorithm. Using the algorithm, we have found 18 new irreducible trinomials of degree r in the range 100151 ≤ r ≤ 70005...
متن کاملAlgorithms for Finding Almost Irreducible and Almost Primitive Trinomials
Consider polynomials over GF(2). We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree r for all Mersenne exponents r = ±3 mod 8 in the range 5 < r < 10, although there is no irreducible trinomial of degree r. We also give trinomials with a primitive factor of degree r ...
متن کامل