Publication:3101433

From MaRDI portal


zbMath1248.94006MaRDI QIDQ3101433

Vladimir Shpilrain, Alexander Ushakov, Alexei G. Myasnikov

Publication date: 29 November 2011



68Q25: Analysis of algorithms and problem complexity

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

03D35: Undecidability and degrees of sets of sentences

94-02: Research exposition (monographs, survey articles) pertaining to information and communication theory

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

94A62: Authentication, digital signatures and secret sharing


Related Items

Solving the Conjugacy Decision Problem via Machine Learning, Unnamed Item, Unnamed Item, Unnamed Item, CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM, GENERAL ALGEBRAIC CRYPTOGRAPHIC KEY EXCHANGE SCHEME AND ITS CRYPTANALYSIS, Algorithmic problems in Engel groups and cryptographic applications, A key exchange protocol using matrices over group ring, Knapsack problems in groups, Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family, SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA, On Eulerian semigroups of multivariate transformations and their cryptographic applications, Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank, Authenticated commutator key agreement protocol, The status of polycyclic group-based cryptography: a survey and open problems, A nonlinear decomposition attack, Linear decomposition method in analyzing hidden information protocols on algebraic platforms, Undeniable signature scheme based over group ring, Cryptanalysis of a key exchange protocol based on the endomorphisms ring \(\mathrm{End}(\mathbb Z_p\times\mathbb Z_{p^2})\), Generic case completeness, Randomness and complexity in matrix groups, Reidemeister classes and twisted inner representations., Knapsack problems in products of groups, Algorithmic problems in right-angled Artin groups: complexity and applications, Analysis of secret sharing schemes based on Nielsen transformations, Analysis of a key exchange protocol based on tropical matrix algebra, Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra, Attack on Kayawood protocol: uncloaking private keys, LWE from non-commutative group rings, Linear groups and computation, An improved version of the AAG cryptographic protocol, Conjugacy search problem and the Andrews-Curtis conjecture, Two general schemes of algebraic cryptography, An attack on the Walnut digital signature algorithm, Conjugacy systems based on nonabelian factorization problems and their applications in cryptography, Some new platforms for algebraic cryptography and one method of increasing the security, Enhanced matrix power function for cryptographic primitive construction, Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography, Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two, Asymptotic Density and the Theory of Computability: A Partial Survey, Non-associative key establishment protocols and their implementation, Using Semidirect Product of (Semi)groups in Public Key Cryptography