A New Block Cipher Based on Finite Automata Systems

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

doi:10.31436/ijpcc.v2i1.31

Cited by 6 publications

(4 citation statements)

References 7 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The adversary can perform dictionary attack by guessing or trying all possible keys to decrypt C text . Since P text is encrypted by FSA based encryption A that provides better security ( 11,21,22,23,24,25 ) due to its invertibility concept. The adversaries need to identify decryption key A −1 to decrypt the ciphertext.…”

Section: Brute-force and Dictionary Attackmentioning

confidence: 99%

FSAaCIT: Finite State Automata based One-Key Cryptosystem and Chunk-based Indexing Technique for Secure Data De-duplication in Cloud Computing

Kodada¹

2022

Preprint

View full text Add to dashboard Cite

<p>The popularity of cloud technology is expanding day-by-day not only to the enterprises but also to the smart phone users due to its various service models available at lower cost. The storage service is one of the widely used service to outsource massive amount of data. With the growth of internet facility and availability, the massive amount of data is being outsourced to cloud storage server with duplicate entries. The duplicate data at server may leads to the consumption of more computational resources.It is essential to prevent the redundant data at cloud storage server to improve efficiency of storage service. These outsourced data contains sensitive information like health related information and can be compromised by inner and outer adversaries. Therefore, safety and security of sensitive information is essential in the cloud computing, but conventional crytosystem and deduplication contradicts to each other due to private keys used for encoding and decoding process, and also current cryptosystems are suffers from content distribution attack, fake key and fake ownership claiming attacks during data deduplication process. Therefore, This paper presents Finite State Automata based one-key cryptosystem and Hash-based indexing technique to achieve secure data deduplication process. The statistical analysis is carried out on system and results shows the strength of the proposed algorithms. The paper also presents Proof of Ownership and Data Integrity Verification protocol to protect the data from unauthorized access and modification. The overall analysis and results shows the strength of proposed approach as compared to existing system in reducing the utilization of</p> <p>computational resources.</p>

show abstract

Section: Brute-force and Dictionary Attackmentioning

confidence: 99%

FSAaCIT: Finite State Automata based One-Key Cryptosystem and Chunk-based Indexing Technique for Secure Data De-duplication in Cloud Computing

Kodada¹

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…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

“…Further improvements and extensions of Dӧmӧsi's cryptosystem can be found in [8][9][10][11][12][13][14]. To overcome the backtracking drawback, and improve the performance of Dӧmӧsi's cryptosystem, G. Khaleel et.…”

Section: Modified Dömösi's Cryptosystemmentioning

confidence: 99%