Preferred Language
Articles
/
bsj-4882
An Efficient Image Encryption Using a Dynamic, Nonlinear and Secret Diffusion Scheme
...Show More Authors

The growing use of tele

This paper presents a new secret diffusion scheme called Round Key Permutation (RKP) based on the nonlinear, dynamic and pseudorandom permutation for encrypting images by block, since images are considered particular data because of their size and their information, which are two-dimensional nature and characterized by high redundancy and strong correlation. Firstly, the permutation table is calculated according to the master key and sub-keys. Secondly, scrambling pixels for each block to be encrypted will be done according the permutation table. Thereafter the AES encryption algorithm is used in the proposed cryptosystem by replacing the linear permutation of ShiftRows step with the nonlinear and secret permutation of RKP scheme; this change makes the encryption system depend on the secret key and allows both to respect the second Shannon’s theory and the Kerckhoff principle. Security analysis of cryptosystem demonstrates that the proposed diffusion scheme of RKP enhances the fortress of encryption algorithm, as can be observed in the entropy and other obtained values.

communications implementing electronic transfers of personal data, require reliable techniques and secure. In fact, the use of a communication network exposes exchanges to certain risks, which require the existence of adequate security measures. The data encryption is often the only effective way to meet these requirements. This paper present a cryptosystem by block for encrypting images, as images are considered particular data because of their size and their information, which are two dimensional nature and characterized by high redundancy and strong correlation. In this cryptosystem, we used a new dynamic diffusion technique called round key permutation, which consists to permute pixels of each bloc in a manner nonlinear, dynamic and random using permutation table calculated according to the master key and sub-keys. We use thereafter the AES encryption algorithm in our cryptosystem by replacing the linear permutation of ShiftRows with round key permutation technique; this changing makes the encryption scheme depend on encryption key. Security analysis of cryptosystem demonstrate that the modification made on using the proposed technique of Round Key Permutation enhances the fortress of encryption  algorithm,  as can be observed in the entropy and other obtained values.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Feb 04 2019
Journal Name
Journal Of The College Of Education For Women
Astronomi cal Color Image Compression Using Multilevel Block Truncation Coding –Modified Vector Quantization Technique
...Show More Authors

A common approach to the color image compression was started by transform
the red, green, and blue or (RGB) color model to a desire color model, then applying
compression techniques, and finally retransform the results into RGB model In this
paper, a new color image compression method based on multilevel block truncation
coding (MBTC) and vector quantization is presented. By exploiting human visual
system response for color, bit allocation process is implemented to distribute the bits
for encoding in more effective away.
To improve the performance efficiency of vector quantization (VQ),
modifications have been implemented. To combines the simple computational and
edge preservation properties of MBTC with high c

... Show More
View Publication Preview PDF
Publication Date
Thu Jun 30 2011
Journal Name
Iraqi Journal Of Chemical And Petroleum Engineering
A PARTICULAR SOLUTION OF THE TWO AND THREE DIMENSIONAL TRANSIENT DIFFUSION EQUATIONS
...Show More Authors

A particular solution of the two and three dimensional unsteady state thermal or mass diffusion equation is obtained by introducing a combination of variables of the form,
η = (x+y) / √ct , and η = (x+y+z) / √ct, for two and three dimensional equations
respectively. And the corresponding solutions are,
θ (t,x,y) = θ0 erfc (x+y)/√8ct and θ( t,x,y,z) =θ0 erfc (x+y+z/√12ct)

View Publication Preview PDF
Publication Date
Thu Nov 02 2023
Journal Name
Journal Of Engineering
An Improved Adaptive Spiral Dynamic Algorithm for Global Optimization
...Show More Authors

This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Jun 23 2023
Journal Name
Communications In Mathematical Biology And Neuroscience
The dynamic of an eco-epidemiological model involving fear and hunting cooperation
...Show More Authors

In the present paper, an eco-epidemiological model consisting of diseased prey consumed by a predator with fear cost, and hunting cooperation property is formulated and studied. It is assumed that the predator doesn’t distinguish between the healthy prey and sick prey and hence it consumed both. The solution’s properties such as existence, uniqueness, positivity, and bounded are discussed. The existence and stability conditions of all possible equilibrium points are studied. The persistence requirements of the proposed system are established. The bifurcation analysis near the non-hyperbolic equilibrium points is investigated. Numerically, some simulations are carried out to validate the main findings and obtain the critical values of th

... Show More
View Publication Preview PDF
Scopus (7)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Mon Mar 01 2021
Journal Name
Iop Conference Series: Materials Science And Engineering
An efficient multistage CBIR based on Squared Krawtchouk-Tchebichef polynomials
...Show More Authors
Abstract<p>Image databases are increasing exponentially because of rapid developments in social networking and digital technologies. To search these databases, an efficient search technique is required. CBIR is considered one of these techniques. This paper presents a multistage CBIR to address the computational cost issues while reasonably preserving accuracy. In the presented work, the first stage acts as a filter that passes images to the next stage based on SKTP, which is the first time used in the CBIR domain. While in the second stage, LBP and Canny edge detectors are employed for extracting texture and shape features from the query image and images in the newly constructed database. The p</p> ... Show More
View Publication
Crossref (4)
Crossref
Publication Date
Tue Jan 01 2008
Journal Name
Lecture Notes In Computer Science
IRPS – An Efficient Test Data Generation Strategy for Pairwise Testing
...Show More Authors

View Publication
Scopus (20)
Crossref (7)
Scopus Crossref
Publication Date
Sat Jan 01 2011
Journal Name
International Journal Of Computer Theory And Engineering
MIPOG - An Efficient t-Way Minimization Strategy for Combinatorial Testing
...Show More Authors

View Publication
Crossref (16)
Crossref
Publication Date
Fri Jan 01 2010
Journal Name
International Journal Of Advanced Intelligence Paradigms
Assessing IRPS as an efficient pairwise test data generation strategy
...Show More Authors

View Publication
Scopus (10)
Crossref (9)
Scopus Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Results In Physics
An efficient iterative method for solving the Fokker–Planck equation
...Show More Authors

View Publication
Crossref (10)
Crossref
Publication Date
Wed Aug 20 2025
Journal Name
International Journal Of Advanced Research In Computer Science
IMPROVE DATA ENCRYPTION BY USING DIFFIE-HELLMAN AND DNA ALGORITHMS, AUTHENTICATED BY HMAC-HASH256
...Show More Authors

: The need for means of transmitting data in a confidential and secure manner has become one of the most important subjects in the world of communications. Therefore, the search began for what would achieve not only the confidentiality of information sent through means of communication, but also high speed of transmission and minimal energy consumption, Thus, the encryption technology using DNA was developed which fulfills all these requirements [1]. The system proposes to achieve high protection of data sent over the Internet by applying the following objectives: 1. The message is encrypted using one of the DNA methods with a key generated by the Diffie-Hellman Ephemeral algorithm, part of this key is secret and this makes the pro

... Show More
View Publication
Crossref