A Novel Block Cipher Algorithm with Feistel-Like Structure
Author(s):
Abstract:
Block ciphers have wide applications for hardware and software implementations. In this paper, a new block cipher algorithm with provable security is proposed. The whole structure of the algorithm is novel and has a good encryption and decryption performance. Additionally, it has good security with few number of rounds. The structure of the proposed algorithm consists of 4-rounds Feistel-Like which uses 3-rounds Feistel type functions. Moreover, a new method for MDS (Maximal Distance Separable) Matrix construction is proposed and used in the round function as a linear layer. Furthermore, some considerations in S-Boxes of the algorithm lead to obtaining better algebraic expression than AES S-boxes. The Algorithm has a high margin of security against various cryptanalysis methods due to using specific functions in its round functions. Our theoretical evaluations show that the devised cipher algorithm has provable security against attacks based on linear and differential cryptanalysis and it is robust against differential, truncated differential, boomerang, and integral cryptanalysis in terms of practical security.
Keywords:
Language:
English
Published:
Journal of Computing and Security, Volume:3 Issue: 1, Winter 2016
Pages:
13 to 26
magiran.com/p1645374
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!