Unpredictable cryptographic primitives for the Robust Wireless Network Security

Citations of this article
Mendeley users who have this article in their library.


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.




Asimi, Y., Asimi, A., Guezzaz, A., Tbatou, Z., & Sadqi, Y. (2018). Unpredictable cryptographic primitives for the Robust Wireless Network Security. In Procedia Computer Science (Vol. 134, pp. 316–321). Elsevier B.V. https://doi.org/10.1016/j.procs.2018.07.178

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free