Jump to content

Group-based cryptography

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Sasha.ushakov (talk | contribs) at 16:13, 15 October 2009 (References). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Group-based cryptography is a use of (nonabelian) groups to construct cryptographic primitives.


Examples

References

  • M. R. Magyarik and N. R. Wagner, A Public Key Cryptosystem Based on the Word Problem. Advances in Cryptology -- CRYPTO 1984, Lecture Notes in Computer Science 196, pp. 19-36. Springer, Berlin, 1985.
  • I. Anshel, M. Anshel, and D. Goldfeld, An algebraic method for public-key cryptography, Math. Res. Lett. 6 (1999), pp. 287-291.
  • K. H. Ko, S. J. Lee, J. H. Cheon, J. W. Han, J. Kang, and C. Park, New public-key cryptosystem using braid groups. Advances in Cryptology -- CRYPTO 2000, Lecture Notes in Computer Science 1880, pp. 166-183. Springer, Berlin, 2000.