scispace - formally typeset
Journal ArticleDOI

On the security of the Merkle- Hellman cryptographic scheme (Corresp.)

Reads0
Chats0
TLDR
A simplified version of the Merkle-Hellman public key cryptographic system was shown to be breakable in this paper, which suggests some ways in which the security of their system can be enhanced.
Abstract
A simplified version of the Merkle-Hellman public key cryptographic system is breakable. While their full-fledged system seems to be resistant to the cryptanalytic attack we propose, the result suggests some ways in which the security of their system can be enhanced.

read more

Citations
More filters
Journal ArticleDOI

Cryptanalysis: a survey of recent results

TL;DR: Attacks on the knapsack cryptosystems, congruential generators, and a variety of two key secrecy and signature schemes are discussed, and some of the basic tools available to the cryptanalyst are explained.
Book ChapterDOI

Efficient computationally private information retrieval from anonymity or trapdoor groups

TL;DR: In this paper, a new family of cPIR protocols with a variety of security and performance properties is presented, which enable much lower CPU overhead for the database server when the database is viewed as a bit sequence.
Journal ArticleDOI

A knapsack-based probabilistic encryption scheme

TL;DR: This paper investigates a new easy compact knapsack problem and proposes a novelknapsack-based probabilistic public-key cryptosystem in which the cipher-text is non-linear with the plaintext, which is secure against the low-density subset-sum attacks.
Proceedings ArticleDOI

The computational complexity of simultaneous Diophantine approximation problems

TL;DR: It is shown that the problem of deciding whether a given vector α of rational numbers has a simultaneous approximation of specified accuracy with respect to the sup norm with denominator Q in a given interval 1 ≤ Q ≤ N is NP-complete.
References
More filters
Journal ArticleDOI

New Directions in Cryptography

TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI

Hiding information and signatures in trapdoor knapsacks

TL;DR: Specific instances of the knapsack problem that appear very difficult to solve unless one possesses "trapdoor information" used in the design of the problem are demonstrated.
Related Papers (5)