2000 character limit reached
A Closer Look at the Multilinear Cryptography using Nilpotent Groups
Published 8 Feb 2021 in math.GR and cs.CR | (2102.04120v1)
Abstract: In a previous paper we generalized the definition of a multilinear map to arbitrary groups and introduced two multiparty key-exchange protocols using nilpotent groups. In this paper we have a closer look at the protocols and will address some incorrect cryptanalysis which have been proposed.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.