Unpredictable cryptographic primitives for the Robust Wireless Network Security

A robust stream cipher algorithm is defined as unpredictable and random generator of the keystreams under minimal perturbations over its inputs. It provides too strong encryption resisting to the attacks founded on the correlation of the regenerated keystreams. The robustness of a wireless network security requires efficient cryptographic primitives and security protocols able to prove the integrity, authentication and confidentiality of the sensitive information. In this paper, we aim to enhance the data confidentiality and integrity of the wireless network. To highlight the data integrity, we introduce a dynamic integrity check code that calculates a checksum from primitive polynomials generator. In our contribution, we focus on the dynamist, unpredictability and non-traceability of sensitive information. We progress our system by a process of regeneration of the primitive polynomials proper to any communication session without touching the internal behavior of the habitual systems. We aim also to introduce a solution Which influences by any minimal perturbation on the sensitive elements. It inspires its robustness by its aptitude to regenerate lightweight, dynamic and robust cryptographic primitives able to ensure robust wireless network security. (C) 2018 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/3.0/) Peer-review under responsibility of the scientific committee of the 13th International Conference on Future Networks and Communications, FNC-2018 and the 15th International Conference on Mobile Systems and Pervasive Computing, MobiSPC 2018.