چکیده مقاله
Nowadays, encryption algorithms are playing efficient role in communication systems and data Absolutely, making a safe connection is cryptography's duty and this science is handling its tasks by presenting encrypting methods; usually, there are some brilliant indexes for these algorithms which are essential like length and type of secret key's characters, required time and ability of operating system for encryption/decryption action By increasing key's length, the security of data will rise and breaking the probable of key breaking will decrease In addition, an ideal cryptography algorithm should be implementable even in poor systems; also, at the sensitive platforms, like financial institutes, time is one of the most important factors for choosing a suitable cryptography method Despite of being hard to understand and limitation for key's character at the most of the encryption algorithms, in this paper we bring a cryptography algorithm based on odd even attribute named OEA, which is able to carry any key with no limitation for its character's length and type; in fact, the experimental comparisons show that the OEA algorithm is strongly secured, and this method needs less time for processing than the other traditional ways; in addition, it has an easy understanding process
کلیدواژهها
نویسندگان
Navid Abapour
Department of Computer Science University of Mohaghegh Ardabili Ardabil, Iran
Rasoul Mahboub
Department of Computer Science University of Mohaghegh Ardabili Ardabil, Iran
شیوه ارجاع
Abapour, Navid and Mahboub, Rasoul,1399,OEA: A novel symmetric cryptography method based on parity attribute,7th International Conference on Innovation and Research in Engineering Sciences
ارائهشده در
مجموعه مقالات هفتمین کنفرانس بین المللی نوآوری و تحقیق در علوم مهندسی6 آبان 1399