Paper Info
Title
On the security of multilevel cryptosystems over class semigroups of imaginary quadratic non-maximal orders
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 K0 from an ideal EK0 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.
Year
DOI
Venue
2006
10.1007/11774716_8
EuroPKI
Keywords
Field
DocType
imaginary quadratic non-maximal order,multilevel cryptosystem,class semigroups,multilevel cryptosystems,key generation algorithm,ideal ek0,rsa algorithm,modern cryptography,multilevel security,clifford semigroup,proposed key management system,key management system,poset dimension,key management,key exchange,partially ordered set,hierarchy,generic algorithm
Key generation,Discrete mathematics,Clifford algebra,Algebra,Computer security,Cryptography,Computer science,Cryptosystem,One-way function,Semigroup,Public-key cryptography,Partially ordered set
Conference
Volume
ISSN
ISBN
4043
0302-9743
3-540-35151-5
Citations 
PageRank 
References 
0
0.34
7
Authors
3
Name
Order
Citations
PageRank
Yong-tae Kim120631.51
Chang Han Kim2698.48
Taek-Young Youn3849.18