Today, data security is a major problem concerning organizations and indi- viduals. The confidentiality of information is associated with using reliable and robust encryption algorithms in systems. Cyber-attacks on data and systems have become prevalent and sophisticated, and are increasing rapidly; hence, the need for developing robust encryption algorithms is crucial nowadays. This paper proposes a new encryption algorithm using dynamic symmetric key cryptography to encrypt text files. It utilizes a secret key for encryption and decryption processes, where the key’s length is varied depending on the text size. This presented approach gives a trade-off between speed and security, making it suitable for various applications, such as secure messages and files. It utilizes the Genetic Algorithm (GA) only for creating a robust key, which re- duces the complexity and computation overheads. The robustness and effectiveness of the proposed encryption algorithm were evaluated thoroughly by implementing several analysis tests, such as entropy, correlation, and the avalanche effect. The results of these tests demonstrate high randomness and uniformity in the created ciphertext and provide an important contribution to the enhancement of the cryptography field for protecting data.
Dylan Thomas (1914-1953) is a modern poet belongs to the apocalyptic movement of the 1940's.This movement is influenced by the doctrines and techniques of surrealism. Poetry for him should not be primarily concerned with man in society, but with the celebration of spiritual truth. It should bring to light the hidden causes, hence his personal interest is to strip darkness and explore the inward motives. To do this he uses a cluster of images: a constant building up and breaking down of images. His poetry depends on the romantic spontaneity, suggestiveness of the Symbolists and the the surrealists' mysterious liberation of the unconsciousness and the emotional involvement in the dynamics of life. In "Light Breaks
... Show MoreImproving" Jackknife Instrumental Variable Estimation method" using A class of immun algorithm with practical application
Future wireless networks will require advance physical-layer techniques to meet the requirements of Internet of Everything (IoE) applications and massive communication systems. To this end, a massive MIMO (m-MIMO) system is to date considered one of the key technologies for future wireless networks. This is due to the capability of m-MIMO to bring a significant improvement in the spectral efficiency and energy efficiency. However, designing an efficient downlink (DL) training sequence for fast channel state information (CSI) estimation, i.e., with limited coherence time, in a frequency division duplex (FDD) m-MIMO system when users exhibit different correlation patterns, i.e., span distinct channel covariance matrices, is to date ve
... Show MoreThroughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.
Electronic remote identification (ER-ID) is a new radio frequency (RF) technology that is initiated by the Federal Aviation Authorities (FAA). For security reasons, traffic control, and so on, ER-ID has been applied for drones by the FAA to enable them to transmit their unique identification and location so that unauthorized drones can be identified. The current limitation of the existing ER-ID algorithms is that the application is limited to the Wi-Fi and Bluetooth wireless controllers, which results in a maximum range of 10–20 m for Bluetooth and 50–100 m for Wi-Fi. In this study, a mathematical computing technique based on finite state automaton (FSA) is introduced to expand the range of the ER-ID RF system and reduce the ene
... Show MoreThe basic solution to overcome difficult issues related to huge size of digital images is to recruited image compression techniques to reduce images size for efficient storage and fast transmission. In this paper, a new scheme of pixel base technique is proposed for grayscale image compression that implicitly utilize hybrid techniques of spatial modelling base technique of minimum residual along with transformed technique of Discrete Wavelet Transform (DWT) that also impels mixed between lossless and lossy techniques to ensure highly performance in terms of compression ratio and quality. The proposed technique has been applied on a set of standard test images and the results obtained are significantly encourage compared with Joint P
... Show MoreThis paper aims to introduce certain new kinds of ideals on pseudo-BG-Algebra (P-BG-A), such as pseudo-closed ideal (P-CI), pseudo-completely closed ideal (P-CCI), and pseudo-n-ideal (P-n-I). Firstly, a (P-n-I) is defined and its pertinent properties are explored. Some important properties have been proven, for example, any pseudo-ideal is a (P-n-I), but the opposite is not generally true, an example was given of the opposite direction. Also, every pseudo-subalgebra of a (P-BG-A) is a pseudo ideal and it is a (P-n-I). Secondly, (P-CI) and a (P-CCI) ideal are defined. After that, we prove that every pseudo-subalgebra of a (P-BG-A) is a (P-CI) and the converse is true. The relationship between (P-BG-A) and pseudo-BH-algebra is demonstrated un
... Show MoreIn this paper, simulation studies and applications of the New Weibull-Inverse Lomax (NWIL) distribution were presented. In the simulation studies, different sample sizes ranging from 30, 50, 100, 200, 300, to 500 were considered. Also, 1,000 replications were considered for the experiment. NWIL is a fat tail distribution. Higher moments are not easily derived except with some approximations. However, the estimates have higher precisions with low variances. Finally, the usefulness of the NWIL distribution was illustrated by fitting two data sets
This paper present the fast and robust approach of English text encryption and decryption based on Pascal matrix. The technique of encryption the Arabic or English text or both and show the result when apply this method on plain text (original message) and how will form the intelligible plain text to be unintelligible plain text in order to secure information from unauthorized access and from steel information, an encryption scheme usually uses a pseudo-random enecryption key generated by an algorithm. All this done by using Pascal matrix. Encryption and decryption are done by using MATLAB as programming language and notepad ++to write the input text.This paper present the fast and robust approach of English text encryption and decryption b
... Show More