On Public-Key Cryptosystems Built Using Polynomial Rings

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 219)


In the paper, a public-key cryptosystem that is, as a matter of fact, a modification of the Merkle-Hellman system has been described. However, unlike the Merkle-Hellman system, it has been built using a polynomial ring. Finally, its quality has been given.

5. Bibiography

  1. [1]
    Berlekamp E.R., Algebraic Coding Theory, McGraw-Hill Book Company, New York, 1968zbMATHGoogle Scholar
  2. [2]
    Denning D.E., Cryptography and Data Security, Addison-Wesley Publishing Company, Reading, Massachusetts, 1982zbMATHGoogle Scholar
  3. [3]
    Brickell E.F., Attacks on Generalized Knapsack Schemes, EUROCRYPT 85, Linz, Austria, 1985Google Scholar
  4. [4]
    Merkle R.C., Hellman M.E., Hiding Information and Signatures in Trapdoor Knapsack, IEEE Trans. on Inf. Theory, Vol. IT-24, September 1978, pp.525–530.CrossRefGoogle Scholar
  5. [5]
    Pieprzyk J.P., Rutkowski D.A., Design of Public-Key Cryptosystems Using Idempotent Elements, Proc. of EUROCON, Brighton, UK, 26–28 September, 1984, pp.64–8Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  1. 1.Institute of TelecommunicationTechnical Academy of BydgoszczBydgoszczPoland

Personalised recommendations