**Applications of Multilinear Forms to Cryptography**

*Dan Boneh and Alice Silverberg*

**Abstract: **We study the problem of finding efficiently computable non-degenerate multilinear maps from (G_1)^n to G_2, where G_1 and G_2 are groups of the same prime order, and where computing discrete logarithms in G_1 is hard. We present several applications to cryptography, explore directions for building such maps, and give some reasons to believe that finding examples with n > 2 may be difficult.

**Category / Keywords: **

**Publication Info: **to appear in the Proceedings of the Conferences in memory of Ruth Michler, Contemporary Mathematics, American Mathematical Society, Providence, RI

**Date: **received 24 Jun 2002, last revised 13 Oct 2002

**Contact author: **silver at math ohio-state edu

**Available format(s): **Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

**Version: **20021013:220501 (All versions of this report)

**Short URL: **ia.cr/2002/080

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]