A public key analog cryptosystem

  • Authors:

  • George I. Davida;Gilbert G. Walter

  • Affiliations:

  • University of Wisconsin-Milwaukee, Milwaukee, WI;University of Wisconsin-Milwaukee, Milwaukee, WI

  • Venue:
  • EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a public key cryptosystem based on error correcting codes [1, 7, 15]. The new public key system is obtained by extending the public key cryptosystem of McEliece [6, 12]. In this scheme a message M, consisting of a column vector of k elements from a finite field is first scrambled by multiplying it by a non singular matrix Q to get M′ = Q M This scrambled message has parity check variables added to it, by multiplying it by a generator matrix G and then has all the variables reordered by multipliation by a permutation matrix P. Noise is then added to obtain the encrypted message C = P G Q M + Z The product of the three matrices G′ = P G Q is made public, but the factors are not.