A New Ciphering Method Associated with Evolutionary Algorithm

Omary, Fouzia; Mouloudi, Abdelaziz; Tragha, Abderrahim; Bellaachia, Abdelghani

doi:10.1007/11751649_38

Cited by 7 publications

(9 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to the results of the occurrence frequencies of the characters obtained, we have shown that this method blocks the way against all the attacks which are based on the study of the occurrence frequencies of characters in a cipher text. We can also increase the security of our system by combining it with another encryption method such as [18]- [22].…”

Section: Discussionmentioning

confidence: 99%

Application of the Tabu Search Algorithm to Cryptography

Kaddouri¹,

Omary²

2017

ijacsa

Self Cite

View full text Add to dashboard Cite

Abstract-Tabu search is a powerful algorithm that has been applied with great success to many difficult combinatorial problems. In this paper, we have designed and implemented a symmetrical encryption algorithm whose internal structure is mainly based on Tabu search algorithm. This heuristic performs multiple searches among different solutions and stores the best solutions in an adaptive memory. First of all, we coded the encryption problem by simulating a scheduling problem. Next, we have used an appropriate coding for our problem. Then we used the suitable evaluation function. Through the symmetric key generated by our algorithm, we have illustrated the principle of encryption and decryption. The experimentations of our approach are given at the end of this paper, from which we examined our new system strengths and the elements that could be improved.

show abstract

Section: Discussionmentioning

confidence: 99%

Application of the Tabu Search Algorithm to Cryptography

Kaddouri¹,

Omary²

2017

ijacsa

Self Cite

View full text Add to dashboard Cite

show abstract

“…Later, genetic and evolutionist algorithms were used in the design of cryptographic algorithms to reach better security like in [7][8][9][10][11]. In [3], [12], [13], and [14], Omary proposed an evolutionist-based encryption scheme and extended versions that aim to substitute the plaintext's characters to change their occurrence frequency. Later, in [15], Trichni proposed an improved version that comprises a new mutation operator based on the partition problem to provide resistance to frequency analysis and brute force attacks.…”

Section: Related Workmentioning

confidence: 99%

“…Later, in [15], Trichni proposed an improved version that comprises a new mutation operator based on the partition problem to provide resistance to frequency analysis and brute force attacks. Afterward, in [16], Bougrine proposed a new encryption scheme inspired by SEC [3] based on the same problem to achieve the same objectives, moreover, in [17] and [18] Kaddouri proposed a revised version of SEC [3]. These works produce a variation of the appearance frequency.…”

Section: Related Workmentioning

confidence: 99%

“…This article's contribution lies in the context of symmetric encryption. It was supposed to be combined with the Symmetrical Evolutionist-based Ciphering (SEC) scheme [3] to make it robust against frequency analysis. In brief, SEC [3] is a symmetric encryption system that substitutes the plaintext's characters and consequently changes their appearance frequency using an evolutionary algorithm.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Partition Ciphering System: A Difficult Problem Based Encryption Scheme

Ziani¹,

Omary²

2019

IJACSA

View full text Add to dashboard Cite

In this article, a new encryption scheme called Partition Ciphering System is proposed to adapt and process the message according to the partition problem. The objective of this system, that can be applied as a standalone system or as a building block in a bigger system, is to achieve confidentiality, and maintain a balance between ones and zeros in the output so that attacks like frequency cryptanalysis is avoided and good entropy is met. At first, the authors describe the partition problem together with an adapted version. Secondly, the encryption and the decryption processes are provided. Next, a comparison, in terms of the statistical properties using the DIEHARDER battery, security analysis and performance, with other encryption schemes is presented. From the results, the proposed cryptosystem is resistant to frequency analysis and shows good entropy in the output. Moreover, compared to the Advanced Encryption Standard, it has a random behavior and good confusion and diffusion(Avalanche effect). Also, it displays better performance and resistance to brute force attack on the key.

show abstract

“…This system is based on techniques of the evolutionary algorithm [2], [3], [4]. This article was followed by another article, where we introduced a new system based on SEC [5], called "fusion" which is safer.…”

Section: Introductionmentioning

confidence: 99%

New Symmetric Encryption System Based on Evolutionary Algorithm

Mouloudi¹

2015

IJCSIT

View full text Add to dashboard Cite

In this article, we present a new symmetric encryption system which is a combination of our ciphering evolutionary system SEC [1] and a new ciphering method called "fragmentation". This latter allows the alteration of the appearance frequencies of characters from a given text. Our system has at its disposed two keys, the first one is generated by the evolutionary algorithm, the second one is generated after "fragmentation" part. Both of them are symmetric, session keys and strengthening the security of our system.

show abstract

A New Ciphering Method Associated with Evolutionary Algorithm

Cited by 7 publications

References 2 publications

Application of the Tabu Search Algorithm to Cryptography

Application of the Tabu Search Algorithm to Cryptography

Partition Ciphering System: A Difficult Problem Based Encryption Scheme

New Symmetric Encryption System Based on Evolutionary Algorithm

Contact Info

Product

Resources

About