An application of Miller Moreno groups to establishment protocol Non commutative cryptography

摘要

The protocol of Ko K., Lee S., are improved and generalized on base of metacyclic and non-metacyclic p-groups $G$ of type Miller-Moreno (minimal non-abelian group). We show that the decomposition problem in this group is intractable. It is proved that the conjugacy problem in this group is also intractable. Further, we have constructed an algorithm of generating (designing) of common key for a non-commutative group with two mutually commuting subgroups has been constructed by us.