Preferred Language
Articles
/
bsj-3244
A New Cipher Based on Feistel Structure and Chaotic Maps
...Show More Authors

Chaotic systems have been proved to be useful and effective for cryptography. Through this work, a new Feistel cipher depend upon chaos systems and Feistel network structure with dynamic secret key size according to the message size have been proposed. Compared with the classical traditional ciphers like Feistel-based structure ciphers, Data Encryption Standards (DES), is the common example of Feistel-based ciphers, the process of confusion and diffusion, will contains the dynamical permutation choice boxes, dynamical substitution choice boxes, which will be generated once and hence, considered static,

            While using chaotic maps, in the suggested system, called Chaotic-based Proposed Feistel Cipher System (CPFCS), we made the confusion and diffusion in dynamical behavior based on Standard and Lorenz maps. The first is used for substitution, and the second one for permutation operations .A proposed cryptographic system uses the same work (the same way) for both enciphering and deciphering. The proposed cipher operates on more than 500 bytes (4000-bit) readable text blocks by six round computing. Within the basic operator of the cipher, i.e., in the function of the round F, a dynamical lookup table 2D standard map system is used to enhance the complexity and diffusion of the unreadable text. Also, a 3D Logistic map used for key sequence generator and chaos based dynamical Initial Permutation (dynamical IP) are used to increase the diffusion and confusion. Three different image sizes and three different text length were implemented in CPFCS.  The results of the proposed system and security tests improve the applicability of PFCS in the data protection and security.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF
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
Mon Aug 01 2022
Journal Name
Mathematics
Face Recognition Algorithm Based on Fast Computation of Orthogonal Moments
...Show More Authors

Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face ima

... Show More
View Publication
Scopus (34)
Crossref (29)
Scopus Clarivate Crossref
Publication Date
Tue May 01 2018
Journal Name
Journal Of Physics: Conference Series
Hiding Techniques for Dynamic Encryption Text based on Corner Point
...Show More Authors

Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.

View Publication Preview PDF
Scopus (12)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Thu Oct 01 2015
Journal Name
Journal Of Engineering
Development of Spatial Data Infrastructure based on Free Data Integration
...Show More Authors

In recent years, the performance of Spatial Data Infrastructures for governments and companies is a task that has gained ample attention. Different categories of geospatial data such as digital maps, coordinates, web maps, aerial and satellite images, etc., are required to realize the geospatial data components of Spatial Data Infrastructures. In general, there are two distinct types of geospatial data sources exist over the Internet: formal and informal data sources. Despite the growth of informal geospatial data sources, the integration between different free sources is not being achieved effectively. The adoption of this task can be considered the main advantage of this research. This article addresses the research question of ho

... Show More
Crossref
Publication Date
Tue Feb 01 2022
Journal Name
Svu-international Journal Of Engineering Sciences And Applications
Water Quality Detection using cost-effective sensors based on IoT
...Show More Authors

Crossref (4)
Crossref
Publication Date
Sun Apr 01 2018
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Information Hiding using LSB Technique based on Developed PSO Algorithm
...Show More Authors

<p>Generally, The sending process of secret information via the transmission channel or any carrier medium is not secured. For this reason, the techniques of information hiding are needed. Therefore, steganography must take place before transmission. To embed a secret message at optimal positions of the cover image under spatial domain, using the developed particle swarm optimization algorithm (Dev.-PSO) to do that purpose in this paper based on Least Significant Bits (LSB) using LSB substitution. The main aim of (Dev. -PSO) algorithm is determining an optimal paths to reach a required goals in the specified search space based on disposal of them, using (Dev.-PSO) algorithm produces the paths of a required goals with most effi

... Show More
View Publication
Scopus (21)
Crossref (7)
Scopus Crossref
Publication Date
Tue Jun 04 2024
Journal Name
Computation
High-Performance Krawtchouk Polynomials of High Order Based on Multithreading
...Show More Authors

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

... Show More
View Publication
Scopus (6)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2017
Journal Name
Ieee Access
Low-Distortion MMSE Speech Enhancement Estimator Based on Laplacian Prior
...Show More Authors

View Publication
Scopus (44)
Crossref (40)
Scopus Clarivate Crossref
Publication Date
Wed Dec 01 2021
Journal Name
Journal Of Physics: Conference Series
Art Image Compression Based on Lossless LZW Hashing Ciphering Algorithm
...Show More Authors
Abstract<p>Color image compression is a good way to encode digital images by decreasing the number of bits wanted to supply the image. The main objective is to reduce storage space, reduce transportation costs and maintain good quality. In current research work, a simple effective methodology is proposed for the purpose of compressing color art digital images and obtaining a low bit rate by compressing the matrix resulting from the scalar quantization process (reducing the number of bits from 24 to 8 bits) using displacement coding and then compressing the remainder using the Mabel ZF algorithm Welch LZW. The proposed methodology maintains the quality of the reconstructed image. Macroscopic and </p> ... Show More
View Publication
Scopus (13)
Crossref (4)
Scopus Crossref
Publication Date
Sat Apr 09 2016
Journal Name
Photonic Sensors
Parametric Analysis of NO2 Gas Sensor Based on Carbon Nanotubes
...Show More Authors

View Publication
Scopus (41)
Crossref (40)
Scopus Clarivate Crossref