2000 character limit reached
Cryptographic multilinear maps using pro-p groups (2102.04513v2)
Published 8 Feb 2021 in cs.CR and math.GR
Abstract: To any nilpotent group of class n, one can associate a non-interactive key exchange protocol between n+1 users. The multilinear commutator maps associated to nilpotent groups play a key role in this protocol. In the present paper, we discuss the security of this key exchange when applied to finite p-groups and explore some alternative platforms, such as pro-p groups.