Diophantine cryptography over infinite groups

MaRDI QIDQ5150520zbMATH OpenFDO

Authors Vitaliĭ Roman'kov

Publication date 15 February 2021

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

zbMATH Keywords

algorithmic problemDiophantine cryptographyDiophantine languageendomorphism problemfree metabelian groupgeneric complexitygroup-based cryptographysearch problem

Mathematics Subject Classification ID

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

Recommendations

• Diophantine cryptography in free metabelian groups: theoretical base.
• Group theoretic cryptography
• Aspects of nonabelian group based cryptography: a survey and open problems
• scientific article; zbMATH DE number 5982274
• Group-based cryptography

Cites work

• A new approach to the conjugacy problem in Garside groups.
• A new look at finitely generated metabelian groups.
• An algebraic method for public-key cryptography
• Artin braids and the groups and spaces connected with them
• Aspects of nonabelian group based cryptography: a survey and open problems
• Authentication schemes from actions on graphs, groups, or rings
• Average Case Complete Problems
• Average case completeness
• Average-case complexity and decision problems in group theory.
• Braids and self-distributivity
• Combinatorial group theory and public key cryptography
• Computing with matrix groups over infinite fields.
• Conjugacy problem in metabelian groups
• Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
• Cryptography and Coding
• Discrete logarithm diophantiness
• Foundations of Cryptography
• Generating random elements of a finite group
• Generic-case complexity, decision problems in group theory, and random walks.
• Group-based cryptography
• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 5982274 (Why is no real title available?)
• scientific article; zbMATH DE number 3115117 (Why is no real title available?)
• scientific article; zbMATH DE number 3131923 (Why is no real title available?)
• scientific article; zbMATH DE number 3138253 (Why is no real title available?)
• scientific article; zbMATH DE number 3845338 (Why is no real title available?)
• scientific article; zbMATH DE number 3897215 (Why is no real title available?)
• scientific article; zbMATH DE number 3910294 (Why is no real title available?)
• scientific article; zbMATH DE number 3925093 (Why is no real title available?)
• scientific article; zbMATH DE number 42574 (Why is no real title available?)
• scientific article; zbMATH DE number 3457134 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1113991 (Why is no real title available?)
• scientific article; zbMATH DE number 1535398 (Why is no real title available?)
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• scientific article; zbMATH DE number 2144676 (Why is no real title available?)
• scientific article; zbMATH DE number 3440654 (Why is no real title available?)
• scientific article; zbMATH DE number 1836314 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 2110413 (Why is no real title available?)
• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• scientific article; zbMATH DE number 3348093 (Why is no real title available?)
• scientific article; zbMATH DE number 3090995 (Why is no real title available?)
• scientific article; zbMATH DE number 3099374 (Why is no real title available?)
• On public-key cryptosystems based on combinatorial group theory
• On the average number of steps of the simplex method of linear programming
• Polynomial time conjugacy in wreath products and free solvable groups.
• Recognizing free metabelian groups
• The Algorithmic Theory of Finitely Generated Metabelian Groups
• THE BRAID GROUP AND OTHER GROUPS
• The word and geodesic problems in free solvable groups.
• Universal diophantine equation
• Using Decision Problems in Public Key Cryptography
• Using the subgroup membership search problem in public key cryptography
• Words. Notes on verbal width in groups.

Cited in

(11)

• scientific article; zbMATH DE number 1107770 (Why is no real title available?)
• Diophantine cryptography in free metabelian groups: theoretical base.
• Linear decomposition method in analyzing hidden information protocols on algebraic platforms
• On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
• 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
• A basis for a partially commutative metabelian group
• Right-Invariance: A Property for Probabilistic Analysis of Cryptography Based on Infinite Groups
• Undecidability of the submonoid membership problem for free nilpotent group of class l\geqslant 2 of sufficiently large rank
• Centroids of commutatively transitive groups

This page was built for publication: Diophantine cryptography over infinite groups

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