A Rao-Nam like Cryptosystem with Product Codes

Ángela I. Barbero and Juan G. Tena
Additional contact information
Ángela I. Barbero: Universidad de Valladolid, Dept. Matemática Aplicada a la Ingeniería (E.T.S. de Ingenieros Industriales)
Juan G. Tena: Universidad de Valladolid, Dept. Álgebra, Geometría y Topología (Fac. de Ciencias)

A chapter in Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, 2002, pp 22-36 from Springer

Abstract: Abstract The purpose of this paper is to design a private key cryptosystem that uses error correcting codes in an efficient way. A secret key variant of the McEliece public key cryptosystem [5] was introduced by Rao and Nam in [7]. One of the practical drawbacks of the Rao-Nam system is that it needs to keep in memory the set of error vectors and syndromes in order to remove the errors in the decryption process. Our proposal is to use the product of random error-correcting linear codes, and to take advantage of the product structure in order to tag the positions in error. The cryptosystem we present will have two main advantages: There are no memory requirements. The decryption process is easy.

Keywords: Linear Code; Error Vector; Information Position; Parity Check; Decryption Process (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-59435-9_2

Ordering information: This item can be ordered from
http://www.springer.com/9783642594359

DOI: 10.1007/978-3-642-59435-9_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().