Abstract
A cryptography for enforcing multilevel security 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 key management systems for multilevel security using one-way hash function, RSA algorithm, Poset dimension and Clifford semigroup in the context of modern cryptography. In particular, the key management system using Clifford semigroup of imaginary quadratic non-maximal orders is based on the fact that the computation of a key ideal K 0 from an ideal EK 0 seems to be difficult unless E is equivalent to O. We, in this paper, show that computing preimages under the bonding homomorphism is not difficult, and that the multilevel cryptosystem based on the Clifford semigroup is insecure and improper to the key management system.
This research was supported by the MIC(Ministry of Information and Communication), Korea, under the ITRC(Information Technology Research Center) support program supervised by the IITA(Institute of Information Technology Assessment).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akl, S.G., Taylor, P.D.: Cryptographic Solution to a Multilevel Security Problem. In: CRYPTO 1982, pp. 237–249 (1982)
Akl, S.G., Taylor, P.D.: Cryptographic Solution to a Problem of Access Controlin Hierarchy. ACM Trans. Computer System 1(3), 239–248 (1983)
Buchmann, J., Williams, H.C.: A key-exchange system based on imaginary quadratic fields. J. Cryptology 1, 107–118 (1988)
Cox, D.: Primes of the form x 2 + n y 2. Wiley, New York (1989)
Cohen, H.: A course in computational algebraic number theory. Springer, Berlin (2000)
Gauss, C.F.: Disquisitiones Arithmeticae. Translated by Clarke, A. Springer, New York (1986)
Jacobson Jr., M.J.: The security of cryptosystems based on class semigroups of imaginary quadratic non-maximal orders. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 149–156. Springer, Heidelberg (2004)
Kim, H., Park, B., Ha, J., Lee, B., Park, D.: New Key Management Systems for Multilevel Security. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3481, pp. 245–253. Springer, Heidelberg (2005)
MacKinnon, S.J., Taylor, P.D., Meijer, H., Akl, S.G.: An Optimal Algorithm for Assignment Cryptographic Keys to Control Access in a Hierarchy. IEEE Trans. on Computers 34(9), 797–802 (1985)
Paulus, S., Tagaki, T.: A new public-key cryptosystem over a quadratic order with quadratic decryption time. Journal of Cryptology 13, 263–272 (2000)
Rivest, R.L., Shamir, A., Adelman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of ACM 21, 120–126 (1978)
Zanardo, P., Zannier, U.: The class semigroup of orders in number fields. Math. Proc. Camb. Phil. Soc. 115, 379–391 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, Y., Kim, C.H., Youn, TY. (2006). On the Security of Multilevel Cryptosystems over Class Semigroups of Imaginary Quadratic Non-maximal Orders. In: Atzeni, A.S., Lioy, A. (eds) Public Key Infrastructure. EuroPKI 2006. Lecture Notes in Computer Science, vol 4043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11774716_8
Download citation
DOI: https://doi.org/10.1007/11774716_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35151-1
Online ISBN: 978-3-540-35152-8
eBook Packages: Computer ScienceComputer Science (R0)