Sciweavers

2 search results - page 1 / 1
» Public Key Cryptosystems Based on Free Partially Commutative...
Sort
View
INDOCRYPT
2003
Springer
14 years 4 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
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 11 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata