Evaluation of Key Dependent S-Box Based Data Security Algorithm using Hamming Distance and Balanced Output

Data security is a major issue because of rapid evolution of data communication over unsecured internetwork. Here the proposed system is concerned with the problem of randomly generated S-box. The generation of S-box depends on Pseudo-Random-Number-Generators and shared-secret-key. The process of Ps...

Full description

Saved in:
Bibliographic Details
Published inTEM Journal Vol. 5; no. 1; pp. 67 - 75
Main Authors Balajee, Maram K, Gnanasekar, J M
Format Journal Article
LanguageEnglish
Published Novi Pazar UIKTEN - Association for Information Communication Technology Education and Science 01.02.2016
Subjects
Online AccessGet full text
ISSN2217-8309
2217-8333
DOI10.18421/TEM51-11

Cover

More Information
Summary:Data security is a major issue because of rapid evolution of data communication over unsecured internetwork. Here the proposed system is concerned with the problem of randomly generated S-box. The generation of S-box depends on Pseudo-Random-Number-Generators and shared-secret-key. The process of Pseudo-Random-Number-Generator depends on large prime numbers. All Pseudo-Random-Numbers are scrambled according to shared-secret-key. After scrambling, the S-box is generated. In this research, large prime numbers are the inputs to the Pseudo-Random-Number-Generator. The proposed S-box will reduce the complexity of S-box generation. Based on S-box parameters, it experimentally investigates the quality and robustness of the proposed algorithm which was tested. It yields better results with the S-box parameters like Hamming Distance, Balanced Output and Avalanche Effect and can be embedded to popular cryptography algorithms
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2217-8309
2217-8333
DOI:10.18421/TEM51-11