access icon free Linear complexity of Legendre-polynomial quotients

Let p be an odd prime and be a positive integer. The authors continue to investigate the binary sequence over defined from polynomial quotients by modulo p. The is generated in terms of which equals to the Legendre symbol of for u ≥ 0. In an earlier work, the linear complexity of was determined for (i.e. the case of Fermat quotients) under the assumption of . In this work, they develop a naive trick to calculate all possible values on the linear complexity of for all under the same assumption. They also state that the case of larger can be reduced to that of . So far, the linear complexity is almost determined for all kinds of Legendre-polynomial quotients.

Inspec keywords: polynomials; Legendre polynomials

Other keywords: positive integer; Legendre symbol; Legendre-polynomial quotients; Fermat quotients; integers; binary sequence; linear complexity

Subjects: Algebra, set theory, and graph theory; Combinatorial mathematics; Combinatorial mathematics; Algebra

References

    1. 1)
      • 13. Crandall, R., Dilcher, K., Pomerance, C.: ‘A search for Wieferich and Wilson primes’, Math. Comput., 1997, 66, (217), pp. 433449.
    2. 2)
      • 9. Chen, Z., Winterhof, A.: ‘Polynomial quotients: distribution of values and Waring's problem’, Acta Arithmetica, 2015, 170, (2), pp. 121134.
    3. 3)
      • 4. Chen, Z., Gómez-Pérez, D.: ‘Linear complexity of binary sequences derived from polynomial quotients’. Sequences and their Applications-SETA 2012, Springer, Berlin, 2012 (LNCS, 7280), pp. 181189.
    4. 4)
      • 8. Aly, H., Winterhof, A.: ‘Boolean functions derived from Fermat quotients’, Cryptogr. Commun., 2011, 3, pp. 165174.
    5. 5)
      • 6. Du, X., Klapper, A., Chen, Z.: ‘Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations’, Inf. Process. Lett., 2012, 112, pp. 233237.
    6. 6)
      • 5. Chen, Z., Niu, Z., Wu, C.: ‘On the k-error linear complexity of binary sequences derived from polynomial quotients’, Sci. China Inf. Sci., 2015, 58, (9), pp. 115.
    7. 7)
      • 3. Chen, Z., Du, X.: ‘On the linear complexity of binary threshold sequences derived from Fermat quotients’, Des. Codes Cryptogr., 2013, 67, pp. 317323.
    8. 8)
      • 11. Sha, M.: ‘The arithmetic of Carmichael quotients’, Period. Math. Hung., 2015, 71, (1), pp. 1123.
    9. 9)
      • 2. Chen, Z.: ‘Trace representation and linear complexity of binary sequences derived from Fermat quotients’, Sci. China Inf. Sci., 2014, 57, (11), pp. 110.
    10. 10)
      • 14. Cusick, T.W., Ding, C., Renvall, A.: ‘Stream ciphers and number theory’ (North-Holland Mathematical Library 55, Elsevier/North-Holland, 1998), revised edition, vol. 66 (The North-Holland Mathematical Library, 2004).
    11. 11)
      • 7. Chen, Z., Winterhof, A.: ‘Additive character sums of polynomial quotients’. Theory and Applications of Finite Fields-Fq10, Contemporary Mathematics, 579, American Mathematical Society, Providence, RI, 2012, pp. 6773.
    12. 12)
      • 10. Gómez-Pérez, D., Winterhof, A.: ‘Multiplicative character sums of Fermat quotients and pseudorandom sequences’, Period. Math. Hung., 2012, 64, pp. 161168.
    13. 13)
      • 12. Akbary, A., Siavashi, S.: ‘The largest known Wieferich numbers’, Integers, 2018, 18, (#A3), pp. 16.
    14. 14)
      • 1. Ostafe, A., Shparlinski, I.E.: ‘Pseudorandomness and dynamics of Fermat quotients’, SIAM J. Discrete Math., 2011, 25, pp. 5071.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2017.0307
Loading

Related content

content/journals/10.1049/iet-ifs.2017.0307
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading