A New Hard Problem over Non-commutative Finite Groups for Cryptographic Protocols

摘要

A new computationally difficult problem defined over non-commutative finite groups is proposed as cryptographic primitive. The problem is used to construct public key agreement protocol and algorithms for public and commutative encryption. Finite non-commutative groups of the four-dimension vectors over the ground field are constructed and investigated as primitives for implementing the protocols and algorithms based on the proposed difficult problem.