49 research outputs found
Polynomial based key distribution scheme for WPAN
No full textSecurity plays a vital role in Wireless Personal Area Network where the data has to be transmitted in free space. The security of the data depends upon the key used for encryption/decryption. Also a secret key has to be shared among the nodes to establish a secure link. The secret key should be resilient to attacks. Key distribution among the nodes in Wireless Personal Area Network is a challenging task. To guarantee the message freshness, a rolling code sequence is appended with the transmitted message. In this paper, various feedback shift registers were analyzed for generating the rolling code and a polynomial based Key distribution scheme is proposed for secured communication protocol in Wireless Personal Area Network. Nonlinear feedback shift register with high linear complexity is used for generating the rolling code. Also the Node Capture Impact for the proposed scheme is compared with other existing scheme. The proposed scheme features a Node Capture Impact equals to zero for even any number of compromised nodes, which is recommended characteristic of a key distribution scheme
Cryptanalysis of Simplified-AES Encrypted Communication
No full textGenetic algorithm based Cryptanalysis has gained considerable attention due to its fast convergence time. This article proposes a Genetic Algorithm (GA) based cryptanalysis scheme for breaking the key employed in Simplified- AES. The authors' proposed GA allows them to break the key using a Known Plaintext attack requiring a lower number of Plaintext-Ciphertext pairs compared to existing solutions. Moreover, their approach allows them to break the S-AES key using also a Ciphertext-only attack. As far as they are concerned, it is the first time that GAs are used to perform this kind of attack on S-AES. Experimental results prove that their proposed fitness function along with GA have drastically reduced the search space by a factor of 10 in case of Known plain text and 1.8 in case of Ciphertext only attack
An Efficient and Secure Location Update Protocol Using Fractal-Based Public Keys in Mobile IP Networks
No full textComparison of wavelet, contourlet and curvelet transform with modified particle swarm optimization for despeckling and feature enhancement of SAR image
No full textA framework for OWL DL based Ontology Construction from Relational Database using Mapping and Semantic Rules
No full text
AN ENHANCED BINDING UPDATE SCHEME FOR NEXT GENERATION INTERNET PROTOCOL MOBILITY
No full textIn recent years, the usage of mobile devices has become essential for people, both for business and for their daily activities. The mobile devices can get services directly from their home network and from other correspondent devices regardless of their position without using any intermediate agent. It is achieved by using mobility based Internet Protocol version 6, called as next
generation internet protocol mobility. Since network mobility uses open air interface as a communication medium, it is possible for many security threats and attacks that might attempt to get unauthorized access from the participating entities. Consequently, the protection of network mobility from threats is one of the most demanding tasks as it must be considered without increasing the complexity while enhancing security. Hence, the paper proposes an enhanced location update scheme by incorporating the optimal
asymmetric encryption method based on the random oracle model for providing security and efficiency. It emphasizes the security goals such as authentication, integrity, and confidentiality from the security analysis. In addition, it addresses the attack prevention analysis for the attacks such as rerun, man-in-the-middle and false location update. The proposed scheme is simulated and verified for security properties using a security validation tool - Automated Validation of Internet Security Protocols and Applications. Finally, the simulation studies show that the latency of the proposed scheme is reduced significantly when compared the other location update schemes
Cryptanalysis of Simplified-AES using Particle Swarm Optimisation
No full textParticle swarm optimisation (PSO) based cryptanalysis has gained much attention due to its fast convergence rate. This paper proposes a PSO-based cryptanalysis scheme for breaking the key employed in simplified-advance encryption standard (S-AES). The cost function is derived using letter frequency analysis. The novelty in our approach is to apply ciphertext-only attack for an S-AES encryption system, where we obtained the key in a minimum search space compared to the Brute-Force attack. Experimental results prove that PSO can be used as an effective tool to attack the key used in S-AES.Defence Science Journal, 2012, 62(2), pp.117-121, DOI:http://dx.doi.org/10.14429/dsj.62.77
