Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Khan, Jan Sher1; * | Khan, Muazzam Ali2 | Ahmad, Jawad3 | Hwang, Seong Oun4 | Ahmed, Waqas5
Affiliations: [1] Department of Electrical and Electronics, University of Gaziantep, 27310 Gaziantep, Turkey. E-mail: jskm893@gmail.com | [2] Department of Computing, School of Electrical Engineering and Computer Science, National University of Sciences and Technology, Islamabad, Pakistan. E-mail: khattakmuazzam@gmail.com | [3] Glasgow Caledonian University, School of Engineering and Built Environment, Glasgow, United Kingdom. E-mail: jawad.saj@gmail.com | [4] Department of Computer and Information Communication Engineering, Hongik University, Sejong, South Korea. E-mail: sohwang@hongik.ac.kr | [5] Department of Electrical Engineering, HITEC University, Taxila, Pakistan. E-mail: imwaqasahmed@live.com
Correspondence: [*] Corresponding author.
Abstract: World has become a global village after introduction of social media and social networks. However, it extensively increased the demand for network resources, particularly multimedia traffic like images, videos and audio. The medium for this extensive traffic is always public networks such as internet or cellular networks. But the open nature of such network like internet always creates security threats for data during transmission. Due to many intrinsic features and higher correlation in multimedia traffic, existing encryption algorithms are not very convincing to perform well under critical scenarios. Therefore, many people in the research community are still working to propose new encryption schemes which can address these issues and handle multimedia traffic effectively on public networks. In this paper, we explore the weaknesses of existing encryption schemes, which compromise in many scenarios due to high correlation of multimedia traffic. To tackle this issue we proposed certain enhancements in an existing scheme. Our enhanced modification includes addition of bitwise XORed operation using non-linear chaotic algorithm. Performance of enhanced scheme is tested against state of the art security parameters. Efficiency of the proposed scheme is also validated via entropy, correlation, peak signal to noise ratio, unified average change intensity and number of pixels change rate tests.
Keywords: non-linear chaotic algorithm, substitution box, chaos, uniform average change intensity, number of pixel change
Journal: Informatica, vol. 28, no. 4, pp. 629-649, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl