Abstract
A way to attack public-key cryptosystems based on the knapsack problem is proposed. The basic idea of the approach described is to find pairs of natural numbers, namely values for a modulus \( \bar m \) and a multiplier \( \bar w \), which reduce the knapsack elements simultaneously by modular multiplication. The ratio \( \bar r = {{\bar w} \mathord{\left/ {\vphantom {{\bar w} {\bar m}}} \right. \kern-\nulldelimiterspace} {\bar m}} \) plays an overriding role.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eier, R., Lagger, H. (1983). Trapdoors in Knapsack Kryptosystems. In: Beth, T. (eds) Cryptography. EUROCRYPT 1982. Lecture Notes in Computer Science, vol 149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39466-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-39466-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11993-7
Online ISBN: 978-3-540-39466-2
eBook Packages: Springer Book Archive