Diophantine cryptography in free metabelian groups: theoretical base.

DOI10.1515/GCC-2014-0011MaRDI QIDQ472158zbMATH OpenOpenAlexFDO

Authors Alexei Myasnikov, Vitaliĭ Roman'kov

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) Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16)

Recommendations

• Diophantine cryptography over infinite groups
• Using Decision Problems in Public Key Cryptography
• Security analysis of word problem-based cryptosystems
• scientific article; zbMATH DE number 5982274
• Constructions in public-key cryptography over matrix groups

Cited in

(4)

• Diophantine cryptography over infinite groups
• 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
• Groups elementarily equivalent to a finitely generated free metabelian group

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472158)