Skip to main content
SpringerLink
Log in

Modifications of the Rao-Nam Cryptosystem

  • Conference paper
Coding Theory, Cryptography and Related Areas

Abstract

Rao and Nam [7] proposed a secret-key cryptosystem based on error correcting codes. After breaking the original system by a chosenplaintext attack, Struik and van Tilburg [8] improved the Rao-Nam cryptosystem. However, the size of the key remains a practical problem also for their improved scheme. We discuss several modifications of the improved Rao-Nam system. The goal of these modifications is to reduce the amount of secret key that needs to be exchanged, while maintaining the security of the system.1

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E. R. Berlekamp, R. J. McEliece, and H. van Tilborg, “On the inherent intractability of certain coding problems”, IEEE Transactions on Information Theory 24 (1978), pp. 384-386.

    Article  MATH  Google Scholar 

  2. T. Berson, “Failure of the McEliece public-key cryptosystem under message-resend and related-message attack”, in: Lecture Notes in Computer Science 330; Advances in Cryptology - Proceedings of CRYPTO’97 Springer, 1998.

    Google Scholar 

  3. E. F. Brickell and A. M. Odlyzko, “Cryptanalysis - A Survey of Recent Results”, in: Contemporary Cryptology: The Science of Information Integrity, G. Simmons (Ed.), Ch. 10, IEEE Press, 1992.

    Google Scholar 

  4. P. J. M. Hin, “Channel-error-correcting privacy cryptosystem”, Ph. D. Thesis, Delft University of Technology (1986, in Dutch).

    Google Scholar 

  5. P. J. Lee and E. F. Brickell, “An observation on the security of McEliece’s public-key cryptosystem”, in: Lecture Notes in Computer Science 330; Advances in Cryptology - Proceedings of CRYPTO’88, pp. 275-280, Springer, 1988.

    Google Scholar 

  6. R. J. McEliece, “A public-key cryptosystem based on algebraic coding theory”, DSN progress Report 42-44, Jet Propulsion Laboratory, Pasadena, 1978.

    Google Scholar 

  7. T. R. N. Rao and K. H. Nam, “Private-Key Algebraic-Coded Cryptosystem”, in: Lecture Notes in Computer Science 263; Advances in Cryptology - Proceedings of CRYPTO’86, A. M. Odlyzko (Ed.), pp. 35-48, Springer, 1987.

    Google Scholar 

  8. R. Struik and J. van Tilburg, “The Rao-Nam scheme is insecure against a chosenplaintext attack”, in: Lecture Notes in Computer Science 293; Advances in Cryptology - Proceedings of CRYPTO’87 C. Pomerance (Ed.), pp. 445-457, Springer, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics Applied to Engineering, University of Valladolid, 47011, Valladolid, Spain

    Ángela I. Barbero

  2. Dept. of Informatics, University of Bergen, N-5020, Bergen, Norway

    Øyvind Ytrehus

Authors
  1. Ángela I. Barbero
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Øyvind Ytrehus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Informatik, Technische Universität Darmstadt, Alexanderstrasse 10, 64283, Darmstadt, Germany

    Johannes Buchmann

  2. Department of Mathematics, Technical University of Denmark, Bldg. 303, 2800, Lyngby, Denmark

    Tom Høholdt

  3. Fachbereich 6, Mathematik und Informatik, Universität Gesamthochschule Essen, 45117, Essen, Germany

    Henning Stichtenoth

  4. Departamento de Matemáticas, Universidad Autónoma Metropolitana-Iztapalapa, Apartado Postal 55-532, C.P. 09340, México, D.F., México

    Horacio Tapia-Recillas

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barbero, Á.I., Ytrehus, Ø. (2000). Modifications of the Rao-Nam Cryptosystem. In: Buchmann, J., Høholdt, T., Stichtenoth, H., Tapia-Recillas, H. (eds) Coding Theory, Cryptography and Related Areas. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57189-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-57189-3_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66248-8

  • Online ISBN: 978-3-642-57189-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation