S. Ebrahimi Atani
Department of Mathematics, University of Guilan, P.O. Box 1914, Rasht, Iran.
[ 1 ] - T-dual Rickart modules
We introduce the notions of T-dual Rickart and strongly T-dual Rickart modules. We provide several characterizations and investigate properties of each of these concepts. It is shown that every free (resp. finitely generated free) $R$-module is T-dual Rickart if and only if $overline{Z}^2(R)$ is a direct summand of $R$ and End$(overline{Z}^2(R))$ is a semisimple (resp. regular) ring. It is sho...
[ 2 ] - Total graph of a $0$-distributive lattice
Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...
[ 3 ] - The total graph of a commutative semiring with respect to proper ideals
Let $I$ be a proper ideal of a commutative semiring $R$ and let $P(I)$ be the set of all elements of $R$ that are not prime to $I$. In this paper, we investigate the total graph of $R$ with respect to $I$, denoted by $T(Gamma_{I} (R))$. It is the (undirected) graph with elements of $R$ as vertices, and for distinct $x, y in R$, the vertices $x$ and $y$ are adjacent if and only if $x + y in P(I)...
[ 4 ] - Primal strong co-ideals in semirings
In this paper, we introduce the notion of primal strong co-ideals and give some results involving them. It is shown thatsubtractive strong co-ideals are intersection of all primal strong co-ideals that contain them. Also we prove that the representation of strong co-ideals as reduced intersections of primal strong co-ideals is unique.
[ 5 ] - EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
[ 6 ] - A New Ring-Based SPHF and PAKE Protocol On Ideal Lattices
emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...
نویسندگان همکار