Chosen-ciphertext attack on noncommutative Polly Cracker
classification
💻 cs.IT
cs.CRmath.IT
keywords
crackernoncommutativepollyattackchosen-ciphertextchoosesclaimedcryptosystem
read the original abstract
We propose a chosen-ciphertext attack on recently presented noncommutative variant of the well-known Polly Cracker cryptosystem. We show that if one chooses parameters for this noncommutative Polly Cracker as initially proposed, than the system should be claimed as insecure.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.