A multiple-iterated trapdoor for dense compact knapsacks

11Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A modification to the multiple-iterated Merfcle-Hellman trapdoor is described that permits a knapsack density exceeding the critical density 0.94 of the Lagarias-Odlyzko low-density attack. A high density level also permits fast signature generation. Compaction and common knapsack weights are used to reduce the public-key size. The security of the new trapdoor depends on a simultaneous diophantine approximation problem plus a residue recombination problem.

Cite

CITATION STYLE

APA

Orton, G. (1995). A multiple-iterated trapdoor for dense compact knapsacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 950, pp. 112–130). Springer Verlag. https://doi.org/10.1007/bfb0053429

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