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

Learn More →

Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography

Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its... Abstract. We consider the multiple conjugacy search problem over a subclass of partially commutative groups and experimentally attack it with a genetic algorithm hybridised with a “length attack”. We detail symbolic computation of words over the groups, constructing functions which measure certain statistics of those words. By experimentation, the hybrid algorithm is shown to be effective, showing that the standard conjugacy search problem is harder than the multiple conjugacy search problem for our groups. Moreover, some intuitive methods of increasing problem difficulty are overcome by the algorithm, and in fact make the problem easier to solve. We show our algorithm is efficient, comparing well with traditional approaches in groups that are statistically similar. Finally, via “approximation” of braid groups by our subclass, we consider implications of the attack on certain cryptosystems, pointing to further work in the discipline of group-theoretic cryptography. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography

Download PDF
31 pages

Loading next page...
 
/lp/de-gruyter/evolutionary-algorithm-solution-of-the-multiple-conjugacy-search-520BZ7hVji
Publisher
de Gruyter
Copyright
Copyright © 2012 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2012-0002
Publisher site
See Article on Publisher Site

Abstract

Abstract. We consider the multiple conjugacy search problem over a subclass of partially commutative groups and experimentally attack it with a genetic algorithm hybridised with a “length attack”. We detail symbolic computation of words over the groups, constructing functions which measure certain statistics of those words. By experimentation, the hybrid algorithm is shown to be effective, showing that the standard conjugacy search problem is harder than the multiple conjugacy search problem for our groups. Moreover, some intuitive methods of increasing problem difficulty are overcome by the algorithm, and in fact make the problem easier to solve. We show our algorithm is efficient, comparing well with traditional approaches in groups that are statistically similar. Finally, via “approximation” of braid groups by our subclass, we consider implications of the attack on certain cryptosystems, pointing to further work in the discipline of group-theoretic cryptography.

Journal

Groups - Complexity - Cryptology – de Gruyter

Published: May 1, 2012

There are no references for this article.