Implementation of Hash Function Based On Neural Cryptography?
Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 4)Publication Date: 2014-04-30
Authors : Vineeta Soni; Sarvesh Tanwar; Prema K.V.;
Page : 1380-1386
Keywords : Neural Network; Cryptography; Tree parity machines; Piecewise linear chaotic map; hash function; plain text sensitivity; data signature;
Abstract
In this paper a new hash function is constructed based on multilayer feed forward network with piecewise linear chaotic map. Chaos has been used in data protection because of the features of initial value sensitivity, random similarity and ergodicity. We have used three neuronal layers to prove confusion, diffusion and compression respectively. This hash function takes input of arbitrary length and generate a fixed length hash value.(128 bit, 256 bit or 512 bit). By performance analysis and results we have shown that generated hash function is one way, collision resistant and secure against birthday attacks and man in middle attacks.
Other Latest Articles
- PERFORMANCE ANALYSIS OF DISTINCT SECURED AUTHENTICATION PROTOCOLS USED IN THE RESOURCE CONSTRAINED PLATFORM
- NOISE SECURES SECRET DATA! BY ACT AS A REFERENCE FOR EMBEDDING
- AN ENERGY EFFICIENT FITNESS BASED ROUTING PROTOCOL IN WIRELESS SENSOR NETWORKS
- PRIORITIZED QUEUE WITH ROUND ROBIN SCHEDULER FOR BUFFERED CROSSBAR SWITCHES
- DCRS: A DYNAMIC CONTENTION RESOLUTION SCHEME FOR WIMAX NETWORKS
Last modified: 2014-05-06 23:50:24