Optimization the chaos based image encryption using TLBO algorithm

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

Image encryption is a crucial component of data security nowadays. Due to its inherent properties such as sensitivity to initial condition, ergodicity and systematic parametrization chaos systems have been extensively used in image encryption. However, one needs to optimize the chaos for each image being encrypted to provide high quality encryption. Features such as high entropy or low pixel correlation are measures of interest in image encryption. In this paper, we propose a novel technique to optimize a chaos based image encryption algorithm. The image is confused using logistic map as chaos function and diffused by modified Knuth shuffling algorithm. We use the logistic map parameters as encryption key. We then harness TLBO and GSA evolutionary algorithms to speed up the optimization process of these parameters. The optimization method yields parameters that lead to lowest correlation among adjacent pixels or highest entropy. We compare the quality and security of our cryptosystem with some famous image encryption methods in the literature.

Language:
Persian
Published:
Electronics Industries, Volume:9 Issue: 1, 2018
Pages:
83 to 92
magiran.com/p2034816  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!