Abstract
In this talk, we show some interesting relations between the problem of attacking multiple encryption schemes and attacking knapsack systems. The underlying relation, of problems of a bicomposite nature, allows introducing a series of algorithms for the dissection of these problems, thus offering significantly better time/memory tradeoffs than previously known algorithms.
For the case of finding the keys used in a multiple-encryption scheme with r independent n-bit keys, previous error-free attacks required time T and memory M satisfying TM = 2rn. Our new technique yields the first algorithm which never errs and finds all the possible keys with a smaller product of TM (e.g., for 7-encryption schemes in time T = 24n and memory M = 2n). The improvement ratio we obtain increases in an unbounded way as r increases, and if we allow algorithms which can sometimes miss solutions, we can get even better tradeoffs by combining our dissection technique with parallel collision search (offering better complexities than the parallel collision search variants).
After discussing multiple encryption, we show that exactly the same algorithm can be used to offer attacks on knapsacks, which work for any knapsack, that offer the best known time-memory tradeoff curve. This algorithm can be used to handle also more general types of knapsacks, involving a combination of modular additions, XORs, and any T-functions.
This is a joint work with Itai Dinur, Nathan Keller, and Adi Shamir.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dunkelman, O. (2012). From Multiple Encryption to Knapsacks – Efficient Dissection of Composite Problems. In: Galbraith, S., Nandi, M. (eds) Progress in Cryptology - INDOCRYPT 2012. INDOCRYPT 2012. Lecture Notes in Computer Science, vol 7668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34931-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-34931-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34930-0
Online ISBN: 978-3-642-34931-7
eBook Packages: Computer ScienceComputer Science (R0)