A characteristic of wireless sensor networks (WSNs) different from traditional networks is that WSNs are vulnerable to various types of attacks because of their distinctive features, involving distributed and nomadic attribute, wireless transmission medium, and lack of centralized infrastructure of security protection. Recently, Kumari et al presented a mutual authentication and key agreement scheme for WSNs using chaotic maps. Unfortunately, we find that the scheme of Kumari et al cannot resist sensor node capture attack, session‐specific temporary information attack, sensor node impersonation attack, and man‐in‐the‐middle attack. To overcome the security weaknesses in the solution of Kumari et al, this paper introduces a secure and efficient mutual authentication and key agreement scheme for heterogeneous ad hoc WSNs in fully public channel. Consequently, compared with the solution of Kumari et al, while providing relatively higher level of security and more security features, the proposed solution remains a favorable performance on communication overhead, computation overhead, and storage overhead separately.
In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number of variables can be constructed. It is shown that given any m, one can construct infinitely many n-variable (n even), m-resilient functions with nonlinearity > 2 n−1 − 2 n/2 . A large class of highly nonlinear resilient functions which were not known are obtained. Then one method to optimize the degree of the constructed functions is proposed. Last, an improved version of the main construction is given.
Substitution boxes (S-boxes) play a central role in the modern design of iterative block ciphers. While in substitution-permutation networks (SPN) the S-boxes are bijective, thus ensuring the invertibility of the encryption algorithm, the property of being bijective is not mandatory for Feistel kind of networks. In this article, two methods of constructing highly nonlinear balanced S-boxes (whose nonlinearity > 2 n−1 − 2 n/2 is better than the nonlinearity of the commonly used inverse S-box) with good algebraic and differential properties are given. The first method employs two vectorial Boolean functions from the Maiorana-McFarland class that need to fulfil certain conditions. In particular, these conditions are shown to be satisfied by maximum length sequences. The second method is based on a suitable modification of a certain class of vectorial bent functions. The differential properties of these boxes, measured as a deviation from an optimal uniform distribution, also appear to be better than those of the inverse S-box. Both methods are susceptible to further optimizations of the relevant cryptographic parameters due to the underlying design ideas.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.