• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.4
• /
• pp.605-610
• /
• 2013

A cryptography for enforcing hierarchic groups in a system where hierarchy is represented by a partially ordered set was introduced by Akl et al. But the key generation algorithm of Akl et al. is infeasible when there is a large number of users. To overcome this shortage, in 1985, MacKinnon et al. proposed a paper containing a condition which prevents cooperative attacks and optimizes the assignment. In 2005, Kim et al. proposed the key management systems for using one-way hash function, RSA algorithm, poset dimension and Clifford semigroup in the context of modern cryptography, the key management system using Clifford semigroup of imaginary quadratic non-maximal orders. We, in this paper, show that Kim et al. cryptosystem is insecure in some reasons and propose a revised cryptosystem.

• Journal of applied mathematics & informatics
• /
• v.40 no.5_6
• /
• pp.1181-1198
• /
• 2022

In this paper we are concerned with the number of fuzzy subgroups of a finite abelian p-group ℤ_p^m × ℤ_pⁿ × ℤ_p^ℓ of rank three with order p^m+n+ℓ. We obtain a recurrence relation for the number of fuzzy subgroups of a finite abelian p-group ℤ_p^m × ℤ_pⁿ × ℤ_p^ℓ. In order to show that using this recurrence relation, one can find explicit formulas for the number of fuzzy subgroups of ℤ_p^m × ℤ_pⁿ × ℤ_p^ℓ consecutively, we give explicit formulas for the number of fuzzy subgroups of ℤ_p^m × ℤ_pⁿ × ℤ_p^ℓ where (n, ℓ) = (1, 1), (2, 1), (3, 1), (4, 1), (5, 1), (2, 2), (3, 2), (4, 2), (5, 2).