• Journal of Information Technology Services
• /
• v.7 no.4
• /
• pp.221-230
• /
• 2008

Green's relations are five equivalence relations that characterize the elements of a semigroup in terms of the principal ideals. The J relation is one of Green's relations. Although there are known algorithms that can compute Green relations, they are not useful for finding all J relations in the semigroup of all $n{\times}n$ Boolean matrices. Its computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices. The size of the semigroup of all $n{\times}n$ Boolean matrices grows exponentially as n increases. It is easy to see that it involves exponential time complexity. The computation of J relations over the $5{\times}5$ Boolean matrix is left an unsolved problem. The paper shows theorems that can reduce the computation time, discusses an algorithm for efficient J relation computation whose design reflects those theorems and gives its execution results.

• Journal of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.1323-1336
• /
• 2015

Let S be a semigroup with 0 and R be a ring with 1. We extend the definition of the zero-divisor graphs of commutative semigroups to not necessarily commutative semigroups. We define an annihilating-ideal graph of a ring as a special type of zero-divisor graph of a semigroup. We introduce two ways to define the zero-divisor graphs of semigroups. The first definition gives a directed graph ${\Gamma}$(S), and the other definition yields an undirected graph ${\overline{\Gamma}}$(S). It is shown that ${\Gamma}$(S) is not necessarily connected, but ${\overline{\Gamma}}$(S) is always connected and diam$({\overline{\Gamma}}(S)){\leq}3$. For a ring R define a directed graph ${\mathbb{APOG}}(R)$ to be equal to ${\Gamma}({\mathbb{IPO}}(R))$, where ${\mathbb{IPO}}(R)$ is a semigroup consisting of all products of two one-sided ideals of R, and define an undirected graph ${\overline{\mathbb{APOG}}}(R)$ to be equal to ${\overline{\Gamma}}({\mathbb{IPO}}(R))$. We show that R is an Artinian (resp., Noetherian) ring if and only if ${\mathbb{APOG}}(R)$ has DCC (resp., ACC) on some special subset of its vertices. Also, it is shown that ${\overline{\mathbb{APOG}}}(R)$ is a complete graph if and only if either $(D(R))^2=0,R$ is a direct product of two division rings, or R is a local ring with maximal ideal m such that ${\mathbb{IPO}}(R)=\{0,m,m^2,R\}$. Finally, we investigate the diameter and the girth of square matrix rings over commutative rings $M_{n{\times}n}(R)$ where $n{\geq} 2$.

• Honam Mathematical Journal
• /
• v.26 no.3
• /
• pp.247-256
• /
• 2004

Buchmann and Williams[1] proposed a key exchange system making use of the properties of the maximal order of an imaginary quadratic field. $H{\ddot{u}}hnlein$ et al. [6,7] also introduced a cryptosystem with trapdoor decryption in the class group of the non-maximal imaginary quadratic order with prime conductor q. Their common techniques are based on the properties of the invertible ideals of the maximal or non-maximal orders respectively. Kim and Moon [8], however, proposed a key-exchange system and a public-key encryption scheme, based on the class semigroups of imaginary quadratic non-maximal orders. In Kim and Moon[8]'s cryptosystem, a non-invertible ideal is chosen as a generator of key-exchange ststem and their secret key is some characteristic value of the ideal on the basis of Zanardo et al.[9]'s quantity for ideal equivalence. In this paper we propose the methods for finding the non-invertible ideals corresponding to non-primitive quadratic forms and clarify the structure of the class semigroup of non-maximal order as finitely disjoint union of groups with some quantities correctly. And then we correct the misconceptions of Zanardo et al.[9] and analyze Kim and Moon[8]'s cryptosystem.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.90-96
• /
• 2011

In this paper, we propose a new discrete logarithm problem(DLP) based on the class semigroups of imaginary quadratic non-maximal orders using the special character of non-invertible ideal and analysis its security. To do this, we first explain the mathematical background explicitly and prove some properties of Cls (O) which relate to constructing the DLP and guaranteeing the security. To test the security of the proposed DLP, we compare the class number of the maximal order with that of the non-maximal order and investigate the unique factorization problems of ideals between class groups of the maximal orders and class semigroups of non-maximal orders to ensure the security of the cryptosystem.

• Communications of the Korean Mathematical Society
• /
• v.30 no.3
• /
• pp.143-154
• /
• 2015

Characterizations of hesitant fuzzy left (right) ideals are considered. The notion of hesitant fuzzy (generalized) bi-ideals is introduced, and related properties are investigated. Relations between hesitant fuzzy generalized bi-ideals and hesitant fuzzy semigroups are discussed, and characterizations of (hesitant fuzzy) generalized bi-ideals and hesitant fuzzy bi-ideals are considered. Given a hesitant fuzzy set $\mathcal{H}$ on a semigroup S, hesitant fuzzy (generalized) bi-ideals generated by $\mathcal{H}$ are established.

• Korean Journal of Mathematics
• /
• v.8 no.1
• /
• pp.43-45
• /
• 2000

In this paper, we give the characterization of a left (right) filter of $po$-semigroups.

• Communications of the Korean Mathematical Society
• /
• v.11 no.2
• /
• pp.315-321
• /
• 1996

Recently, N. Kehayopulu [4] introduced the concepts of weakly prime ideals of ordered semigroups. In this paper, we define the concepts of left(right) weakly prime and left(right) semiregular. Also we investigate the properties of them.

• Honam Mathematical Journal
• /
• v.26 no.3
• /
• pp.309-330
• /
• 2004

In this paper, we apply the concept of intuitionistic fuzzy sets to theory of semigroups. We give some properties of intuitionistic fuzzy ideals and intuitionistic fuzzy bi-ideals, and characterize which is left [right] simple, left [right] duo and a semilattice of left [right] simple semigroups or another type of semigroups in terms of intuitionistic fuzzy ideals and intuitionistic fuzzy bi-ideals.

• Communications of the Korean Mathematical Society
• /
• v.15 no.3
• /
• pp.499-509
• /
• 2000

In [9], the concept of fuzzy sets is applied to the theory of Ζ-ideals in a BCI-semigroup (it was renamed as an IS-algebra for the convenience of study), and a characterization of fuzzy Ζ-ideals by their level Ζ-ideals was discussed. In this paper, we study further properties of fuzzy Ζ-ideals. We prove that the homomorphic image and preimage of a fuzzy Ζ-ideal are also fuzzy Ζ-ideals.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.737-744
• /
• 2018

The RSA cryptosystem is a one of the first public-key cryptosystems and is widely used for secure data transmission and electric signature. The security of the RSA cryptosystem is based on the difficulty of factoring large numbers.. Though many studies on finding methods for factoring large numbers are going on, the results of that are all experimental or probabilistic. We, in this paper, construct an algorithm for finding large prime factors of integers without factoring integers using properties of the structure of semigroup of imaginary quadratic order and non-invertible ideal, then propose our methods foe deterministic attack against RSA cryptosystem.