Showing papers on "Hybrid cryptosystem published in 1996"
Journal Article•
TL;DR: In this paper, a trapdoor one-way function was proposed to derive public-key encryption and digital signatures based on the conjectured computational difficulty of lattice-reduction problems.
Abstract: We present a new proposal for a trapdoor one-way function, from which we derive public-key encryption and digital signatures The security of the new construction is based on the conjectured computational difficulty of lattice-reduction problems, providing a possible alternative to existing public-key encryption algorithms and digital signatures such as RSA and DSS
431 citations
Journal Article•
IBM1
TL;DR: A probabilistic public key cryptosystem which is secure unless the worst case of the following lattice problem can be solved in polynomial time is presented in this paper.
Abstract: We present a probabilistic public key cryptosystem which is secure unless the worst case of the following lattice problem can be solved in polynomial time: “Find the shortest nonzero vector in an n dimensional lattice L where the shortest vector v is unique in the sense that any other vector whose length is at most n’ [lull is parallel to v.”
82 citations
Journal Article•
8 citations
04 Feb 1996
TL;DR: It is demonstrated that designing a master-key Cryptosystem with acceptable performance is roughly equivalent to designing a public-key cryptosystem in which encryption is much faster than is possible with current public-keys techniques.
Abstract: We initiate the study of a new class of secret-key cryptosystems, called "master-key cryptosystems," in which an authorized third party possesses a "master key" that allows efficient recovery of the cleartext without knowledge of the session key. One motivation for this study is that master-key cryptosystems could provide a less cumbersome alternative to "key escrow" in situations in which third-party access is required. We demonstrate that designing a master-key cryptosystem with acceptable performance is roughly equivalent to designing a public-key cryptosystem in which encryption is much faster than is possible with current public-key techniques.
6 citations
01 Jan 1996
TL;DR: A new copyright protection scheme which features the use of a personal card and the dividing between various parties of a customer’s card private key for a RSA public key cryptosystems is proposed.
Abstract: A major problem in circulating copyrighted digital content through a computer network is how to protect against the illegal copying of the content. As a means of addressing this problem, we propose a new copyright protection scheme which features the use of a personal card (e.g. PCMCIA Card, PC Card) and the dividing between various parties of a customer’s card private key for a RSA public key cryptosystems (Rivest, 1978). Our proposed scheme has many advantages in key management.
01 Jan 1996
TL;DR: It is shown that there is strong evidence for the security of the cryptosystem, and the cipher makes use of truly random bits, so it gets a probabilistic scheme, which is not suspicious to methods like diierential or linear crypt-analysis.
Abstract: We present a new block cipher, which was constructed following novel design criteria. There are no iterated round functions, only one simple transformation must be applied for encryption. The cipher makes use of truly random bits, so we get a probabilistic scheme, which is not suspicious to methods like diierential or linear crypt-analysis. We show that there is strong evidence for the security of the cryptosystem, and we will present en eecient realization.