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

Learn More →

A linear decomposition attack

A linear decomposition attack Abstract We discuss a new attack, termed a dimension or linear decomposition attack, on several known group-based cryptosystems. This attack gives a polynomial time deterministic algorithm that recovers the secret shared key from the public data in all the schemes under consideration. Furthermore, we show that in this case, contrary to the common opinion, the typical computational security assumptions are not very relevant to the security of the schemes, i.e., one can break the schemes without solving the algorithmic problems on which the assumptions are based. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Loading next page...
 
/lp/de-gruyter/a-linear-decomposition-attack-9WWMEqHhDN
Publisher
de Gruyter
Copyright
Copyright © 2015 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2015-0007
Publisher site
See Article on Publisher Site

Abstract

Abstract We discuss a new attack, termed a dimension or linear decomposition attack, on several known group-based cryptosystems. This attack gives a polynomial time deterministic algorithm that recovers the secret shared key from the public data in all the schemes under consideration. Furthermore, we show that in this case, contrary to the common opinion, the typical computational security assumptions are not very relevant to the security of the schemes, i.e., one can break the schemes without solving the algorithmic problems on which the assumptions are based.

Journal

Groups Complexity Cryptologyde Gruyter

Published: May 1, 2015

There are no references for this article.