Abstract
Consider a maximum-length binary shift-register sequence generated by a primitive polynomial f of degree m. Let \(C_n^f\) denote the set of all subintervals of this sequence with length n, where m < n ≤ 2m, together with the zero vector of length n. Munemasa (Finite fields Appl, 4(3): 252–260, 1998) considered the case in which the polynomial f generating the sequence is a trinomial satisfying certain conditions. He proved that, in this case, \(C_n^f\) corresponds to an orthogonal array of strength 2 that has a property very close to being an orthogonal array of strength 3. Munemasa’s result was based on his proof that very few trinomials of degree at most 2m are divisible by the given trinomial f. In this paper, we consider the case in which the sequence is generated by a pentanomial f satisfying certain conditions. Our main result is that no trinomial of degree at most 2m is divisible by the given pentanomial f, provided that f is not in a finite list of exceptions we give. As a corollary, we get that, in this case, \(C_n^f\) corresponds to an orthogonal array of strength 3. This effectively minimizes the skew of the Hamming weight distribution of subsequences in the shift-register sequence.
Similar content being viewed by others
References
Delsarte P (1973) Four fundamental parameters of a code and their combinatorial significance. Inf Control 23:407–438
Dewar M, Moura L, Panario D, Stevens B, Wang Q (2006) Division of trinomials by pentanomials and orthogonal arrays. Technical Report TR-2006-05, SITE, University of Ottawa, p 73.
von zur Gathen J (2003) Irreducible trinomials over finite fields. Math Comp 72:1987–2000
Golomb SW (1982) Shift register sequences. Aegean Park Press, California
Hansen T, Mullen GL (1992) Primitive polynomials over finite fields. Math Comp 59:639–643
IEEE Standard Specifications for Public-Key Cryptography. Technical Report IEEE Std 1361-2000. IEEE Inc., 3 Park Ave., NY 10016-5997, USA
Jordan HF, Wood DCM (1973) On the distribution of sums of successive bits of shift-register sequences. IEEE Trans Comput 22:400–408
Lidl R, Niederreiter H (1994) Introduction to finite fields and their applications 1st edn.Cambridge University Press, Cambridge
Lindholm JH (1968) An analysis of the pseudo-randomness properties of subsequences of long m-sequences. IEEE Trans Inf Theory 14:569–576
Morgan IH, Mullen GL (1993) Primitive normal polynomials over finite fields. Math Comp 63:759–765
Munemasa A (1998) Orthogonal arrays, primitive trinomials, and shift-register sequences. Finite Fields Appl 4(3):252–260
Seroussi G (1998) Table of low-weight binary irreducible polynomials. HP Labs Technical Report HPL-98–135, p 15
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by G. Mullen.
The authors are supported by NSERC of Canada.
Rights and permissions
About this article
Cite this article
Dewar, M., Moura, L., Panario, D. et al. Division of trinomials by pentanomials and orthogonal arrays. Des. Codes Cryptogr. 45, 1–17 (2007). https://doi.org/10.1007/s10623-007-9052-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-007-9052-y