The evolution of cryptography has been crucial to preservation subtle information in the digital age. From early cipher algorithms implemented in earliest societies to recent cryptography methods, cryptography has developed alongside developments in computing field. The growing in cyber threats and the increase of comprehensive digital communications have highlighted the significance of selecting effective and robust cryptographic techniques. This article reviews various cryptography algorithms, containing symmetric key and asymmetric key cryptography, via evaluating them according to security asset, complexity, and execution speed. The main outcomes demonstrate the growing trust on elliptic curve cryptography outstanding its capability and small size, while highlighting the requirement for study in the post-quantum cryptographic field to address the threats rising from quantum computing. The comparative analysis shows a comprehensive understanding that combines classical cryptography algorithms with up-to-date approaches such as chaotic-based system and post-quantum cryptography, confirming that the study addresses the future of cryptography security in the aspect of emerging challenge like quantum computing.
Addressed the problem of the research is marked (experimentation in caves fee) concept and its role in experimentation deviate Display Num formal charges caves. The search came in four sections: general framework for research and identified the research problem and the need for him. With an indication of the importance of his presence. Then specify the search for the goals of (revealed the nature and role of experimentation in determining the nature of Manifesting fee documented on the walls of caves), followed by the establishment of the three search limits (objectivity, the temporal and spatial) were then determine the terms related to the title. Then provide the theoretical framework and indicators that resulted from academic theorizi
... Show MoreThis paper proposes a new encryption method. It combines two cipher algorithms, i.e., DES and AES, to generate hybrid keys. This combination strengthens the proposed W-method by generating high randomized keys. Two points can represent the reliability of any encryption technique. Firstly, is the key generation; therefore, our approach merges 64 bits of DES with 64 bits of AES to produce 128 bits as a root key for all remaining keys that are 15. This complexity increases the level of the ciphering process. Moreover, it shifts the operation one bit only to the right. Secondly is the nature of the encryption process. It includes two keys and mixes one round of DES with one round of AES to reduce the performance time. The W-method deals with
... Show MoreThe research has been concerned with the modalities of foreign trade payments (foreign trade financing), and made an accounting comparison between them to choose the best way to pay for the imported goods (payment of the real values of imported goods), given the importance of the impact of this activity on the national economy of all countries of the world, especially Iraq for the adoption of a very large amount of imported goods to meet the requirements of the people, which require the flow of huge amounts of foreign currency outside Iraq to pay for these goods, and therefore dealing incorrectly with it leads to the destruction of the national economy and the spread of a number of negative social and economic phenomena of
... Show MoreThe focus of this paper is the presentation of a new type of mapping called projection Jungck zn- Suzuki generalized and also defining new algorithms of various types (one-step and two-step algorithms) (projection Jungck-normal N algorithm, projection Jungck-Picard algorithm, projection Jungck-Krasnoselskii algorithm, and projection Jungck-Thianwan algorithm). The convergence of these algorithms has been studied, and it was discovered that they all converge to a fixed point. Furthermore, using the previous three conditions for the lemma, we demonstrated that the difference between any two sequences is zero. These algorithms' stability was demonstrated using projection Jungck Suzuki generalized mapping. In contrast, the rate of convergenc
... Show MoreIn this paper, the behavior of structural concrete linear bar members was studied using numerical model implemented in a computer program written in MATLAB. The numerical model is based on the modified version of the procedure developed by Oukaili. The model is based on real stress-strain diagrams of concrete and steel and their secant modulus of elasticity at different loading stages. The behavior presented by normal force-axial strain and bending moment-curvature relationships is studied by calculating the secant sectional stiffness of the member. Based on secant methods, this methodology can be easily implemented using an iterative procedure to solve non-linear equations. A comparison between numerical and experimental data, illustrated
... Show MoreIn this paper, the behavior of structural concrete linear bar members was studied using numerical model implemented in a computer program written in MATLAB. The numerical model is based on the modified version of the procedure developed by Oukaili. The model is based on real stress-strain diagrams of concrete and steel and their secant modulus of elasticity at different loading stages. The behavior presented by normal force-axial strain and bending moment-curvature relationships is studied by calculating the secant sectional stiffness of the member. Based on secant methods, this methodology can be easily implemented using an iterative procedure to solve non-linear equations. A compari