Skip to main content
Conference Proceedings

Trapdoors in knapsack kryptosystems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1983) 149 LNCS 316-322
DOI: 10.1007/3-540-39466-4_23
2Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.
Get full text

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 m and a multiplier w, which reduce the knapsack elements simultaneously by modular multiplication. The ratio r=w/m plays an overriding role.

Cite

CITATION STYLE

APA

Eier, R., & Lagger, H. (1983). Trapdoors in knapsack kryptosystems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 149 LNCS, pp. 316–322). Springer Verlag. https://doi.org/10.1007/3-540-39466-4_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free