Abstract
AbstractWe discuss pitfalls in the security of the combinatorial public key cryptosystem based on Nielsen transformations inspired by the ElGamal cryptosystem proposed by Fine, Moldenhauer and Rosenberger. We introduce three different types of attacks to possible combinatorial public key encryption schemes and apply these attacks to the scheme corresponding to the cryptosystem under discussion. As a result of our observation, we show that under some natural assumptions the scheme is vulnerable to at least one of the proposed attacks.
Funder
Russian Science Foundation
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference68 articles.
1. Infinite groups;J. Math. Sci.,1982
2. A linear decomposition attack;Groups Complex. Cryptol.,2015
3. The Diffie–Hellman key exchange protocol and non-abelian nilpotent groups;Israel J. Math.,2008
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献