On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups

The paper considers a schema for constructing a possibly one-way function on a group with the decidable word problem and undecidable endomorphism problem. Possible prerequisites for reliability of the proposed schema are analyzed. A corresponding authentication protocol with zero knowledge is proposed as an application. It is noted that for its security a more strong assumption on the undecidability of the two-level endomorphism problem is needed.