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 hash function, and the modular subset sum problem

Cryptanalysis of a hash function, and the modular subset sum problem AbstractRecently, Shpilrain and Sosnovski proposed a hash function based on composition of affine maps.In this paper, we show that this hash function with its proposed parameters is notweak collision resistant, for plaintexts of size at least 1.9MB (about 224{2^{24}}bits).Our approach is to reduce the preimage problem to a (very) high density instance of theRandom Modular Subset Sum Problem, for which we give an algorithm capable of solving instances of the resulting size.Specifically, given plaintexts of about 1.9MB, we were able to produce other plaintexts of the same size with the same hash value in about 13 hours each, on average. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Cryptanalysis of a hash function, and the modular subset sum problem

Groups Complexity Cryptology , Volume 11 (1): 7 – May 1, 2019

Loading next page...
 
/lp/de-gruyter/cryptanalysis-of-a-hash-function-and-the-modular-subset-sum-problem-d5aNqv0bih
Publisher
de Gruyter
Copyright
© 2019 Walter de Gruyter GmbH, Berlin/Boston
ISSN
1869-6104
eISSN
1869-6104
DOI
10.1515/gcc-2019-2001
Publisher site
See Article on Publisher Site

Abstract

AbstractRecently, Shpilrain and Sosnovski proposed a hash function based on composition of affine maps.In this paper, we show that this hash function with its proposed parameters is notweak collision resistant, for plaintexts of size at least 1.9MB (about 224{2^{24}}bits).Our approach is to reduce the preimage problem to a (very) high density instance of theRandom Modular Subset Sum Problem, for which we give an algorithm capable of solving instances of the resulting size.Specifically, given plaintexts of about 1.9MB, we were able to produce other plaintexts of the same size with the same hash value in about 13 hours each, on average.

Journal

Groups Complexity Cryptologyde Gruyter

Published: May 1, 2019

There are no references for this article.