Skip to main content
SpringerLink
Log in

Characteristic digit-sum sequences

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

We introduce a new type of sequences using the sum of coefficients of characteristic polynomials for elements (in particular, primitive elements) in a finite field. These sequences are nonlinear filtering sequences of the well-known m-sequences. We show that they have large linear complexity and large period. We also provide some examples of such binary sequences with good autocorrelation values.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. El Bachraoui, M.: On the number of subsets of [1,M] relatively prime to N and asymptotic estimates. Integ. Electron. J. Comb. Number Theory 8, #A41 (2008)

    MathSciNet  MATH  Google Scholar 

  2. Caballero-Gil, P., Fúster-Sabater, A.: A wide family of nonlinear filter functions with a large linear span. Inform. Sci. 164(1-4), 197–207 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cohen, S.D.: Primitive polynomials with a prescribed coefficient. Fin. Fields Appl. 12(3), 425–491 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dai, Z.D., Gong, G., Song, H.Y., Ye, D.F.: Trace representation and linear complexity of binary e-th power residue sequences of period p. IEEE Trans. Inform. Theory 57(3), 1530–1547 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fúster-Sabater, A., Caballero-Gil, P.: On the linear complexity of nonlinearly filtered PN-sequences. In: Advances in Cryptology-ASIACRYPT’94, Lecture Notes in Computer Science, vol. 917, pp 80–90. Springer-Verlag, Berlin (1995)

  6. Gammel, B.M., Gottfert, R.: Linear filtering of nonlinear shift-register sequences, coding and cryptography. Lect. Notes Comput. Sci. 3969, 354–370 (2006)

    Article  MATH  Google Scholar 

  7. Gold, R.: Optimal binary sequences for spread spectrum multiplexing. IEEE Trans. Inform. Theory 14, 154–156 (1968)

    Article  Google Scholar 

  8. Golomb, W., Gong, G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography and Radar. Cambridge University Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  9. Hu, H., Gong, G.: Periods on two kinds of nonlinear feedback shift registers with time varying feedback functions. Int. J. Found. Comput. Sci. 22(6), 1317–1329 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kasami, T: Weight distribution formula for some class of cyclic codes. Coordinated Science Laboratory, University of Illinois, Urbana Technical Report R285 (AD632574) (1966)

  11. Key, E.L.: An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Trans. Inform. Theory 22, 732–736 (1976)

    Article  MATH  Google Scholar 

  12. Kumar, P.V., Scholtz, R.A.: Bounds on the linear span of bent sequences. IEEE Trans. Inform. Theory 29, 854–862 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  13. Macdonald, I.G.: Macdonald, Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, Oxford (1979)

    Google Scholar 

  14. Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory 15, 122–127 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  15. Massey, J.L., Serconek, S.: A fourier transform approach to the linear complexity of nonlinearly filtered sequences. Advances in Cryptology, CRYPTO, vol. 839, Lecture Notes in Computer Science, pp. 332–340 (1994)

  16. No, J.S., Kumar, P.V.: A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span. IEEE Trans. Inform. Theory 35, 371–379 (1989)

    Article  MATH  Google Scholar 

  17. Paterson, K.G., counting, Root: the DFT and the linear complexity of nonlinear filtering. Des. Codes Cryptogr. 14(3), 247–259 (1998)

    Article  MathSciNet  Google Scholar 

  18. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer-Verlag, Berlin (1986)

    Book  MATH  Google Scholar 

  19. Tuxanidy, A., Wang, Q.: A new proof of the Hansen-Mullen irreducibility conjecture. Canad. J. Math., 18. https://doi.org/10.4153/CJM-2017-022-1

  20. Tuxanidy, A., Wang, Q.: Irreducible polynomials with prescribed digit sums. arXiv:1605.00351, pp. 1–13 (2016)

Download references

Acknowledgments

The research of Qiang Wang is partially supported by NSERC of Canada.

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada

    Aleksandr Tuxanidy & Qiang Wang

Authors
  1. Aleksandr Tuxanidy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qiang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qiang Wang.

Additional information

This article is part of the Topical Collection on Special Issue on Sequences and Their Applications

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tuxanidy, A., Wang, Q. Characteristic digit-sum sequences. Cryptogr. Commun. 10, 705–717 (2018). https://doi.org/10.1007/s12095-017-0256-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-017-0256-3

Keywords

Mathematics Subject Classification (2010)

Search

Navigation