Chinks in the Armor of Public Key Cryptosystems
نویسنده
چکیده
Potential weaknesses in public key cryptosystem design and use are identiied with emphasis on a particular vulnerability resulting from the encryption of ordinary natural language plaintext. This weakness occurs when an insuuciently long block length is used to encrypt low entropy natural language and ordinary numeric plaintext rendered in 8-bit character sets such as ASCII or EBCDIC. A computer-assisted, semi-exhaustive chosen plaintext attack is deened and shown to defeat such systems. Several methods are suggested for thwarting such attacks by maximizing input plaintext entropy prior to encryption.
منابع مشابه
QTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملComparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملKnapsack Public Key Cryptosystems And
This paper presents and analyzes cryptanalytic attacks on knapsack public key cryptosystems that are based on ideas from Diophantine approximation. Shamir’s attack on the basic Merkle-Hellman knapsack cryptosystem is shown to depend on the existence of ‘‘unusually good’’ simultaneous Diophantine approximations to a vector constructed from the public key. This aspect of Shamir’s attack carries o...
متن کامل