Theoretical Foundations of Applied Discrete Mathematics
On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
S. Y. Erofeev, V. A. Romankov
Omsk State University, Omsk, Russia
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.
one-way function, endomorphism problem, authentication protocol.
PDF file (540 kB)
S. Y. Erofeev, V. A. Romankov, “On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups”, Prikl. Diskr. Mat., 2012, no. 3(17), 13–24
Citation in format AMSBIB
\by S.~Y.~Erofeev, V.~A.~Romankov
\paper On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
\jour Prikl. Diskr. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|