Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Some characteristics of logistic map over the finite field

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

References

  1. 1

    Kocarev L, Lian S G. Chaos-Based Cryptography. Berlin: Springer, 2011

  2. 2

    Chen F, Wong K W, Liao X F, et al. Period distribution of the generalized discrete Arnold cat map for N = 2e. IEEE Trans Inf Theory, 2013, 59: 3249–3255

  3. 3

    Lima J B, Novaes L F G. Image encryption based on the fractional Fourier transform over finite fields. Signal Process, 2014, 94: 521–530

  4. 4

    Yin R M, Wang J, Yuan J, et al. Weak key analysis for chaotic cipher based on randomness properties. Sci China Inf Sci, 2012, 55: 1162–1171

  5. 5

    Li C Q, Li S J, Lo K T. Breaking a modified substitution-diffusion image cipher based on chaotic standard and logistic maps. Commun Nonlinear Sci Numer Simul, 2011, 16: 837–843

  6. 6

    Yoshida K, Miyazaki T, Uehara S, et al. Some properties of the maximum period on the Logistic map over Z 2n. In: Proceedings of International Symposium on Information Theory and its Applications, Melbourne, 2014. 665–668

  7. 7

    Yang B, Liao X F. Period analysis of the Logistic map for the finite field. Sci China Inf Sci, 2017, 60: 022302

Download references

Acknowledgements

This work was supported by National Key Research and Development Program of China (Grant No. 2016YFB0800601), and National Natural Science Foundation of China (Grant No. 61472331).

Author information

Correspondence to Xiaofeng Liao.

Electronic supplementary material

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Yang, B., Liao, X. Some characteristics of logistic map over the finite field. Sci. China Inf. Sci. 62, 39104 (2019). https://doi.org/10.1007/s11432-017-9438-8

Download citation