A Comparative Performance Analysis of Modified DÓ§mÓ§siâ€™s Cryptosystem and Data Encryption Standard

Khaleel, Ghassan; Turaev, Sherzod; Tamrin, Mohd Izzuddin Mohd; Alshaikhli, Imad Fakhri Taha

doi:10.31436/ijpcc.v3i1.47

Cited by 1 publication

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…New variants of stream and block ciphers based on sequential and parallel finite automata systems, which are closely related to permutation matrix-based cryptosystems, have been thoroughly studied in [11][12][13][14][15][16][17]. Not surprisingly, these systems use transition matrices of finite automata as secrete keys in encryption and decryption algorithms.…”

Section: Related Workmentioning

confidence: 99%

New Cryptosystem Based-on Permutation Matrix

Karimnia¹,

Khaleel²,

Turaev³

2018

IJPCC

Self Cite

View full text Add to dashboard Cite

Cryptography is defined as a technique of transmitting information in a secretive manner so that only authorized people are able to read and process it. The main aim of cryptography is to make sure the message has been received by the receiver in a secure manner, and not being understood by anyone else but the receiver. Although there exist several different cryptosystems, the choice of the best algorithm is the main concern of the researches. In this paper, a new cryptography system based on matrix permutation has been introduced. A permutation matrix is an nï‚´ n matrix which is obtained by permuting its rows and columns according to some permutations of the numbers 0 to n. In this paper, encryption and decryption methodologies have been proposed based on permutation matrices. The algorithms are based on the random selection of the permutation matrix - known as key matrix - entries. The main objective of this research is to evaluate the security and the performance of the proposed cryptosystem as well as to promote the confusion and diffusion.

show abstract