Our active aim in this paper is to prove the following Let Ŕ be a ring having an
idempotent element e(e 0,e 1) . Suppose that R is a subring of Ŕ which
satisfies:
(i) eR R and Re R .
(ii) xR 0 implies x 0 .
(iii ) eRx 0 implies x 0( and hence Rx 0 implies x 0) .
(iv) exeR(1 e) 0 implies exe 0 .
If D is a derivable map of R satisfying D(R ) R ;i, j 1,2. ij ij Then D is
additive. This extend Daif's result to the case R need not contain any non-zero
idempotent element.
Let R be a commutative ring with unity and let M be a left R-module. We define a proper submodule N of M to be a weakly prime if whenever r  R, x  M, 0  r x  N implies x  N or r  (N:M). In fact this concept is a generalization of the concept weakly prime ideal, where a proper ideal P of R is called a weakly prime, if for all a, b  R, 0  a b  P implies a  P or b  P. Various properties of weakly prime submodules are considered.
In this paper, we prove that; Let M be a 2-torsion free semiprime which satisfies the condition for all and α, β . Consider that as an additive mapping such that holds for all and α , then T is a left and right centralizer.
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
In this research note approximately prime submodules is defined as a new generalization of prime submodules of unitary modules over a commutative ring with identity. A proper submodule of an -module is called an approximaitly prime submodule of (for short app-prime submodule), if when ever , where , , implies that either or . So, an ideal of a ring is called app-prime ideal of if is an app-prime submodule of -module . Several basic properties, characterizations and examples of approximaitly prime submodules were given. Furthermore, the definition of approximaitly prime radical of submodules of modules were introduced, and some of it is properties were established.
Let R be an associative ring. In this paper we present the definition of (s,t)- Strongly derivation pair and Jordan (s,t)- strongly derivation pair on a ring R, and study the relation between them. Also, we study prime rings, semiprime rings, and rings that have commutator left nonzero divisior with (s,t)- strongly derivation pair, to obtain a (s,t)- derivation. Where s,t: R®R are two mappings of R.
In this paper, we study the class of prime semimodules and the related concepts, such as the class of semimodules, the class of Dedekind semidomains, the class of prime semimodules which is invariant subsemimodules of its injective hull, and the compressible semimodules. In order to make the work as complete as possible, we stated, and sometimes proved, some known results related to the above concepts.
Speech encryption approaches are used to prevent eavesdropping, tracking, and other security concerns in speech communication. In this paper, a new cryptography algorithm is proposed to encrypt digital speech files. Initially, the digital speech files are rearranged as a cubic model with six sides to scatter speech data. Furthermore, each side is encrypted by random keys that are created by using two chaotic maps (Hénon and Gingerbread chaotic maps). Encryption for each side of the cube is achieved, using the based map vector that is generated randomly by using a simple random function. Map vector that consists of six bits, each bit refers to one of the specific chaotic maps that generate a random key to encrypt each face of the cube. R
... Show MoreCurrently no one can deny the importance of data protection, especially with the proliferation of hackers and theft of personal information in all parts of the world .for these reasons the encryption has become one of the important fields in the protection of digital information.
This paper adopts a new image encryption method to overcome the obstacles to previous image encryption methods, where our method will be used Duffing map to shuffled all image pixels ,after that the resulting image will be divided into a group of blocks for perform the shuffling process via Cross Chaotic Map.
Finally, an image called key image was created by using Quadratic number spirals which will be used to generate nu
In this paper, we study a new concept of fuzzy sub-module, called fuzzy socle semi-prime sub-module that is a generalization the concept of semi-prime fuzzy sub-module and fuzzy of approximately semi-prime sub-module in the ordinary sense. This leads us to introduce level property which studies the relation between the ordinary and fuzzy sense of approximately semi-prime sub-module. Also, some of its characteristics and notions such as the intersection, image and external direct sum of fuzzy socle semi-prime sub-modules are introduced. Furthermore, the relation between the fuzzy socle semi-prime sub-module and other types of fuzzy sub-module presented.
Throughout this paper S will be denote a monoids with zero. In this paper, we introduce the concept of En- prime subact, where a proper subact B of a right S- act As is called En- prime subact if for any endomorphism f of As and a As with f(a)S⊆ Bimplies that either a B or f(As) ⊆ B. The right S-act As is called En-prime if the zero subact of As is En-prime subact. Some various properties of En-prime subact are considered, and also we study some relationships between En-prime subact and some other concepts such as prime subact and maximal subact.