Diophantine cryptography in free metabelian groups: theoretical base.

DOI10.1515/GCC-2014-0011zbMath1319.20031OpenAlexW1972681971MaRDI QIDQ472158

Vitaliĭ Roman'kov, Alexei G. Myasnikov

Publication date: 18 November 2014

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc-2014-0011

zbMATH Keywords

authenticationendomorphism problemfree metabelian groupscryptosystems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solvable groups, supersolvable groups (20F16) Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM ⋮ ON GENERIC UNDECIDABILITY OF HILBERT’S TENTH PROBLEM FOR POLYNOMIAL TREES

This page was built for publication: Diophantine cryptography in free metabelian groups: theoretical base.