In this paper we present a theoretical construction of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with maximum possible AI and further these functions are not symmetric. Our RSBFs are of better nonlinearity than the existing theoretical constructions with maximum possible AI . To get very good nonlinearity, which is important for practical cryptographic design, we g...

On the basis of the bachelor thesis ”performance comparison of cryptographic algorithms in Smart Grid applications” supervised by Dipl. Inf. Michael Niedermeier and Prof. Dr. Hermann de Meer at the chair of Computer Networks and Communications, this paper covers the analysis of the privacy ensuring capabilities of homomorphic cryptography in the Smart Grid with regard to its energy efficiency. ...

Classification of vectorial Boolean functions up to affine equivalence is used widely to analyze various cryptographic and implementation properties of symmetric-key algorithms. We show that there exist 75 affine equivalence classes of 5-bit quadratic permutations. Furthermore, we explore important cryptographic properties of these classes, such as linear and differential properties and degrees...

Encrypted Email using Neural Cryptography is a way of sending and receiving encrypted email through public channel. Neural key exchange, which is based on the synchronization of two tree parity machines, can be a secure replacement for this method. This paper present an implementation of neural cryptography for encrypted E-mail where Tree Parity Machines are initialized with random inputs vecto...

Symmetric key cryptography has been a hot topic because of exchange of secure communication through various networks ligand Investigation of reversible XOR like function for symmetric key cryptography has been a big challenge. Moreover it is also desired that the reversible XOR function must be as efficient as traditional XOR. In the literature related to Automatic Variables Key, Fibonacci-Q ma...

Diffie-Hellman is public key based symmetric key algorithm used for secret key sharing between two parties over public communication channel. Diffie-Hellman is weak when there is man in middle attack done by eavesdropper. Diffie-Hellman algorithm is not provide authentication. Security of Diffie-Hellman cryptography system completely depends upon random prime number selected by user. Finding pr...

Wireless sensor networks are being deployed for a wide variety of applications. It is an important challenge to find out practical security protocols for wireless sensor networks due to limitation of power, computation and storage resources. Symmetric key techniques are attractive due to their energy efficiency. But the drawbacks of symmetric key techniques are evident in terms of key managemen...

Cryptography is the way to secure the data to achieve higher reliability during the communication process. There exist a number of cryptographic approaches. This paper defines a geometry based Symmetric cryptography algorithm that is used to encrypt the input data. As the name suggests the approach is based on the geometric figure to perform the cryptography. In this work, we will define an ell...

Quantum computers are a severe threat to our modern cryptography, as with Shor’s algorithm [14], assymetric cryptography may not be secure anymore. However, the problem has been less studied for symmetric cryptography in the past. Using Grover’s algorithm [5], one can find the private key of an encryption scheme using O( √ n) operations instead of an optimal O(n) in the classical setting (where...

Wireless Sensor Networks (WSNs) are more vulnerable to security attacks than wired networks because of their wireless and dynamic nature. In today’s WSNs, the sensor nodes act not only as routers but also as communication endpoints, and they are also responsible for the security of the messages. Therefore, it is important to define whether an incoming message originates from a trustworthy node ...