This paper presents a hybrid software copy protection scheme, the scheme is applied to
prevent illegal copying of software by produce a license key which is unique and easy to
generate. This work employs the uniqueness of identification of hard disk in personal
computer which can get by software to create a license key after treated with SHA-1 one way
hash function. Two mean measures are used to evaluate the proposed method, complexity
and processing time, SHA-1 can insure the high complexity to deny the hackers for produce
unauthorized copies, many experiments have been executed using different sizes of software
to calculate the consuming time. The measures show high complexity and short execution
time for propos

In this paper the centralizing and commuting concerning skew left -derivations and skew left -derivations associated with antiautomorphism on prime and semiprime rings were studied and  the commutativity of Lie ideal under certain conditions were proved.

KE Sharquie, MM Al-Waiz, AA Noaimi, Iraqi Postgraduate Medical Journal, 2008 - Cited by 1

This paper introduces an innovative method for image encryption called "Two-Fold Cryptography," which leverages the Henon map in a dual-layer encryption framework. By applying two distinct encryption processes, this approach offers enhanced security for images. Key parameters generated by the Henon map dynamically shape both stages of encryption, creating a sophisticated and robust security system. The findings reveal that Two-Fold Cryptography provides a notable improvement in image protection, outperforming traditional single-layer encryption techniques.

Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.

Maximizing the net present value (NPV) of oil field development is heavily dependent on optimizing well placement. The traditional approach entails the use of expert intuition to design well configurations and locations, followed by economic analysis and reservoir simulation to determine the most effective plan. However, this approach often proves inadequate due to the complexity and nonlinearity of reservoirs. In recent years, computational techniques have been developed to optimize well placement by defining decision variables (such as well coordinates), objective functions (such as NPV or cumulative oil production), and constraints. This paper presents a study on the use of genetic algorithms for well placement optimization, a ty

In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.