Pitfalls in public key cryptosystems based on free partially commutative monoids and groups
نویسندگان
چکیده
منابع مشابه
Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both proposals are vulnerable to chosen ciphertext attacks, and thus in the present form must be considered as insecure.
متن کاملOn the Cubical Homology Groups of Free Partially Commutative Monoids
We study a Leech homology of a locally bounded free partially commutative monoid M(E, I). Given a contravariant natural system of abelian groups F on M(E, I) we build a precubical set T (E, I) with a homological system of abelian groups F and prove that the Leech homology groups Hn(M(E, I), F ) are isomorphic to the cubical homology groups Hn(T (E, I), F ), n > 0. As a consequence we have confi...
متن کاملPartially Commutative Inverse Monoids
Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoids are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented, more precisely, we give an O(n log(n)) algorithm for...
متن کاملTransitive factorizations of free partially commutative monoids and Lie algebras
Let M(A, θ) be a free partially commutative monoid. We give here a necessary and sufficient condition on a subalphabet B ⊂ A such that the right factor of a bisection M(A, θ) = M(B, θB).T be also partially commutative free. This extends strictly the (classical) elimination theory on partial commutations and allows to construct new factorizations of M(A, θ) and associated bases of LK(A, θ).
متن کاملEfficient Solution to Some Problems in Free Partially Commutative Monoids
In theoretical computer science, and, in particular, in automata and formal language theory, questions arise concerning words and sets of words in free monoids. Results and techniques from the study of the combinatorial algebra of the free monoid have provided an “algebraic” basis for dealing with many of these questions. In recent years there has been increasing interest in properties of words...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2006
ISSN: 0893-9659
DOI: 10.1016/j.aml.2005.11.014