Abstract
A public key cryptosystem based on free partially commutative monoids is constructed. The encryption of a message to create the cryptotext uses a Thue system which is formed from the free partially commutative monoid with the help of a trapdoor morphism. The decidability of the word problem for free partially commutative monoids can be used for decryption. Finding the trapdoor morphism of this system is shown to be NP-hard. But, a zero - knowledge protocol to convince a verifier that there is such a trapdoor morphism is provided. A related but different public key cryptosystem based on free partially commutative groups is also proposed. © Springer-Verlag Berlin Heidelberg 2003.
Author supplied keywords
Cite
CITATION STYLE
Abisha, P. J., Thomas, D. G., & Subramanian, K. G. (2003). Public key cryptosystems based on free partially commutative monoids and groups. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2904, 218–227. https://doi.org/10.1007/978-3-540-24582-7_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
