scientific article; zbMATH DE number 7310156

zbMath1481.94121MaRDI QIDQ5150520

Vitaliĭ Roman'kov

Publication date: 15 February 2021

Full work available at URL: http://mathnet.ru/eng/pdm362

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

endomorphism problemgroup-based cryptographysearch problemfree metabelian groupgeneric complexityalgorithmic problemDiophantine cryptographyDiophantine language

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear programming (90C05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (7)

Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank ⋮ CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM ⋮ 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 ⋮ Linear decomposition method in analyzing hidden information protocols on algebraic platforms ⋮ A basis for a partially commutative metabelian group ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Authentication schemes from actions on graphs, groups, or rings
• Average-case complexity and decision problems in group theory.
• Group-based cryptography
• Recognizing free metabelian groups
• Artin braids and the groups and spaces connected with them
• Average case completeness
• Generic-case complexity, decision problems in group theory, and random walks.
• Braids and self-distributivity
• An algebraic method for public-key cryptography
• Conjugacy problem in metabelian groups
• Combinatorial group theory and public key cryptography
• Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
• A new approach to the conjugacy problem in Garside groups.
• A New Look at Finitely Generated Metabelian Groups
• Polynomial time conjugacy in wreath products and free solvable groups
• Aspects of Nonabelian Group Based Cryptography: A Survey and Open Problems
• On the average number of steps of the simplex method of linear programming
• Using Decision Problems in Public Key Cryptography
• Average Case Complete Problems
• Universal diophantine equation
• The Algorithmic Theory of Finitely Generated Metabelian Groups
• Foundations of Cryptography
• Generating random elements of a finite group
• The word and geodesic problems in free solvable groups
• Cryptography and Coding
• THE BRAID GROUP AND OTHER GROUPS

This page was built for publication: