Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Cryptanalysis of a combinatorial public key cryptosystem

Cryptanalysis of a combinatorial public key cryptosystem 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Cryptanalysis of a combinatorial public key cryptosystem

Roman’kov, Vitaliĭ
Groups Complexity Cryptology , Volume 9 (2): 11 – Nov 1, 2017
Download PDF
11 pages

Loading next page...
 
/lp/de-gruyter/cryptanalysis-of-a-combinatorial-public-key-cryptosystem-rwRkUnCQZ5
Publisher
de Gruyter
Copyright
© 2017 Walter de Gruyter GmbH, Berlin/Boston
ISSN
1869-6104
eISSN
1869-6104
DOI
10.1515/gcc-2017-0013
Publisher site
See Article on Publisher Site

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.

Journal

Groups Complexity Cryptology – de Gruyter

Published: Nov 1, 2017

There are no references for this article.