Skip to main content
SpringerLink
Log in

A Linear Time Matrix Key Agreement Protocol Over Small Finite Fields

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

This note introduces Braid–Diffie–Hellman (BDH), a key agreement protocol employing matrices over small finite fields. The method employs colored Burau matrices and a refinement of a Diffie–Hellman type protocol. We discuss the security and examine performance parameters of BDH which permit linear time execution on platforms supporting basic algebraic primitives.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Anshel I., Anshel M., Goldfeld D. (1999) An algebraic method for public-key cryptography. Math Res Lett 6, 1–5

    MathSciNet  Google Scholar 

  2. Anshel I., Anshel M., Fisher B., Goldfeld D. (2001). New key agreement protocols in Braid group cryptography. In: Naccache D. (eds). Topics in Cryptography–CTRSA 2001, (Lecture Notes in Computer Science, vol 2020). Springer, Berlin Heidelberg New York

    Google Scholar 

  3. Birman J. (1974) Braids, links and mapping class groups, Annals of Mathematical Studies, Study 82. Princeton University Press, New Jersey

    Google Scholar 

  4. Ko K.H., Lee S.J., Chean J.H., Han J.W., Kang J.S., Park C. (2000). New public-key cryptosystem using braid groups. In: Bellare M. (eds). Advances in Cryptology–Crypto 2000, (Lecture Notes in Computer Science, vol 1880). Springer, Berlin Heidelberg New York

    Google Scholar 

  5. Lee, E., Lee, S.J., Hahn, S.G. Pseudorandomness from Braid groups. In: Advances in Cryptology–Crypto 2001 (Lecture Notes in Computer Science) Berlin Heidelberg New York: Springer (2001)

  6. Morton H.R. (1999) The multivariable alexander polynomial for a closed Braid. Contemp Math AMS 233, 167–172

    MATH  MathSciNet  Google Scholar 

  7. Menzes A.J., van Oorschot P.C., Vanstone S.A. (1997) The handbook of applied cryptography. CRC Press, Boca Raton

    Google Scholar 

  8. Robinson D. (1996) A course in the theory of groups: graduate texts in mathematics 80. Springer, Berlin Heidelberg New York

    Google Scholar 

  9. Sidel’nikov V.M., Cherepenev M.A., Yashichenko V.V. (1994) Systems of open distribution of keys on the basis of noncommutative semigroups. Russ Acad Sci Dolk Math 48(2): 384–386

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Arithmetica Inc., 31 Peter Lynas, Ct. Tenafly, NJ, 07670, USA

    Iris Anshel

  2. City College of New York, New York, NY, 10031, USA

    Michael Anshel

  3. Columbia University, New York, NY, USA

    Dorian Goldfeld

Authors
  1. Iris Anshel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Anshel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dorian Goldfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dorian Goldfeld.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anshel, I., Anshel, M. & Goldfeld, D. A Linear Time Matrix Key Agreement Protocol Over Small Finite Fields. AAECC 17, 195–203 (2006). https://doi.org/10.1007/s00200-006-0001-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-006-0001-1

Keywords

Search

Navigation