scientific article

Vladimir Shpilrain, Alexander Ushakov, Alexei G. Myasnikov

Publication date: 29 November 2011

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

word problems conjugacy problems generic complexity non-commutative cryptography

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Undecidability and degrees of sets of sentences (03D35) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Authentication, digital signatures and secret sharing (94A62)

Related Items (44)

Randomness and complexity in matrix groups ⋮ Some new platforms for algebraic cryptography and one method of increasing the security ⋮ Algorithmic problems in right-angled Artin groups: complexity and applications ⋮ Analysis of secret sharing schemes based on Nielsen transformations ⋮ Using Semidirect Product of (Semi)groups in Public Key Cryptography ⋮ Authenticated commutator key agreement protocol ⋮ The status of polycyclic group-based cryptography: a survey and open problems ⋮ A nonlinear decomposition attack ⋮ Enhanced matrix power function for cryptographic primitive construction ⋮ Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two ⋮ Reidemeister classes and twisted inner representations. ⋮ 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 ⋮ Knapsack problems in products of groups ⋮ Monoidal categories, representation gap and cryptography ⋮ On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups ⋮ Asymptotic Density and the Theory of Computability: A Partial Survey ⋮ Non-associative key establishment protocols and their implementation ⋮ CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM ⋮ GENERAL ALGEBRAIC CRYPTOGRAPHIC KEY EXCHANGE SCHEME AND ITS CRYPTANALYSIS ⋮ 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})$ ⋮ Algorithmic problems in Engel groups and cryptographic applications ⋮ A key exchange protocol using matrices over group ring ⋮ 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 ⋮ Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography ⋮ Generic case completeness ⋮ Linear groups and computation ⋮ Solving the Conjugacy Decision Problem via Machine Learning ⋮ An improved version of the AAG cryptographic protocol ⋮ Conjugacy search problem and the Andrews-Curtis conjecture ⋮ LWE from non-commutative group rings ⋮ Two general schemes of algebraic cryptography ⋮ An attack on the Walnut digital signature algorithm ⋮ Knapsack problems in groups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Conjugacy systems based on nonabelian factorization problems and their applications in cryptography ⋮ Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family ⋮ SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA

This page was built for publication: