Skip to main content
SpringerLink
Log in

On the Wagner–Magyarik Cryptosystem

  • Conference paper
Coding and Cryptography (WCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3969))

Included in the following conference series:

Abstract

We investigate a monoid variant of the scheme based on the word problem on groups proposed by Wagner and Magyarik at Crypto’84, that has the advantage of being immune to reaction attacks so far. We study the security of this variant. Our main result is a complexity-theoretic one: we show that the problem underlying this cryptosystem, say WM, is NP-hard. We also present an algorithm for solving WM. Its complexity permits to shed light on the size of the parameters to choose to reach a given level of security.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. Abisha, P.J., Thomas, D.G., Subramanian, K.G.: Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 218–227. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Book, R.V.: Confluent and Other Types of Thue Systems. Journal of the ACM 29, 171–182 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Book, R.V., Liu, H.N.: Rewriting Systems and Word Problems in a Free Partially Commutative Monoid. Inform. Proc. Letters 26, 29–32 (1987/88)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cori, R., Perrin, D.: Automates et commutations partielles. R.A.I.R.O. Informatique théorique 19, 21–32 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  5. González-Vasco, M.I., Steinwandt, R.: A Reaction Attack on a Public Key Cryptosystem Based on the Word Problem. AAECC 14(5), 335–340 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Knuth, D.E., Bendix, P.B.: Simple Word Problems in Universal Algebras. Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press, New York (1970)

    MATH  Google Scholar 

  7. Levy-dit-Vehel, F., Perret, L.: Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 275–289. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. McNaughton, R.: Contributions of Ronald V. Book to the Theory of String Rewriting Systems. Rensselaer Polytechnic Institute T.R. n0 96 − 19 (1996)

    Google Scholar 

  9. Turing, A.M.: The Word Problem in Semi-groups with Cancellation. Annals of Math 52, 491–505 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  10. Wagner, N.R., Magyarik, M.R.: A Public Key Cryptosystem Based on the Word Problem. In: Peterson, J.L. (ed.) Computer Programs for Spelling Correction. LNCS, vol. 96, pp. 19–36. Springer, Heidelberg (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ENSTA, 32 Boulevard Victor, 75739 cedex 15, Paris, France

    Françoise Levy-dit-Vehel & Ludovic Perret

Authors
  1. Françoise Levy-dit-Vehel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ludovic Perret
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Øyvind Ytrehus

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Levy-dit-Vehel, F., Perret, L. (2006). On the Wagner–Magyarik Cryptosystem. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_25

Download citation

  • DOI: https://doi.org/10.1007/11779360_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35481-9

  • Online ISBN: 978-3-540-35482-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation