Sciweavers

9 search results - page 2 / 2
» The Frobenius Problem in a Free Monoid
Sort
View
INDOCRYPT
2003
Springer
15 years 3 months ago
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 propos...
P. J. Abisha, D. G. Thomas, K. G. Subramanian
INFORMATICALT
2000
126views more  INFORMATICALT 2000»
14 years 10 months ago
Commutation in Global Supermonoid of Free Monoids
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...
Anna Brosalina, Boris Melnikov
IANDC
2008
105views more  IANDC 2008»
14 years 10 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
IJAC
2000
104views more  IJAC 2000»
14 years 10 months ago
Construction of Self-Distributive Operations and Charged Braids
Starting from a certain monoid that describes the geometry of the left self-distributivity identity, we construct an explicit realization of the free left self-distributive system ...
Patrick Dehornoy