Showing papers on "Plaintext-aware encryption published in 1985"

An efficient probabilistic public key encryption scheme which hides all partial information

Abstract: This paper introduces the first probabilistic public-key encryption scheme which combines the following two properties: (1) Perfect secrecy with respect to polynomial time eavesdroppers: For all message spaces, no polynomial time bounded passive adversary who is tapping the lines, can compute any partial information about messages from their encodings, unless factoring composite integers is in probabilisic polynomial time. (2) Efficiecy: It compares favorably with the deterministic RSA public-key cryptosystem in both encoding and decoding time and bandwidth expansion.The security of the system we propose can also be based on the assumption that the RSA function is intractable, maintaining the same cost for encoding and decoding and the Same data expansion. This implementation may have advantages in practice.

A public key cryptosystem based on the word problem

Abstract: The undecidable word problem for groups and semigroups is investigated as a basis for a public-key cryptosystem. A specific approach is discussed along with the results of an experimental implementation This approach does not give a provably secure or practical system, but shows the type of cryptosystem that could be constructed around the word problem. This cryptosystem is randomized, with infinitely many ciphertexts corresponding to each plaintext.

An M³ Public-Key Encryption Scheme

Abstract: It is well known that the RSA public-key cryptosystem can be broken if the composite modulus can be factored. It is nor known, however, whether the problem of breaking any RSA system is equivalent in difficulty to factoring the modulus. In 1979 Rabin [5] introduced a public-key cryptosystem which is as difficult to break as it is to factor a modulus R=p1p2, where p1p2 are two distinct large primes. Esaentially Rabin suggested that the designer of such a scheme first determine p1 and p2, keep them secret and make R public. Anyone wishing to send a secure message H (0 < M < R ) to the designer would encrypt M as K , where $$ K \equiv M^2 (\bmod R)$$ and 0 < K < R, then transmit K to the designer.

Modified Lu-Lee cryptosystem

Abstract: A modified Lu-Lee cryptosystem is proposed which appears to be resistant to the cryptanalytic attacks on the original Lu-Lee scheme. The data expansion due to encryption is moderate, and the size of the public key is also quite small.

A new method for realizing public-key cryptosystem

Abstract: A new method for realizing public-key cryptosystem is proposed in this paper. Three plaintext messages are transformed into three cryptograms in this method. Message authentication is easily realized by this method. Y≡Ax mod P is used as a one-way function, where P is prime.