scientific article; zbMATH DE number 5982274
From MaRDI portal
Publication:3101433
zbMATH Open1248.94006MaRDI QIDQ3101433FDOQ3101433
Authors: Vladimir Shpilrain, Alexander Ushakov, Alexei Myasnikov 
Publication date: 29 November 2011
Title of this publication is not available (Why is that?)
Recommendations
- Non-commutative finite groups as primitive of public key cryptosystems
- The complexity of Grigorchuk groups with application to cryptography
- Aspects of nonabelian group based cryptography: a survey and open problems
- Some cryptoprimitives in noncommutative algebraic cryptography
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Applications to cryptography of twisting commutative algebraic groups
- Secret sharing using non-commutative groups and the shortlex order
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Authentication, digital signatures and secret sharing (94A62) Undecidability and degrees of sets of sentences (03D35)
Cited In (54)
- The group factorization problem in finite groups of Lie type
- On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups
- Randomness and complexity in matrix groups
- Two general schemes of algebraic cryptography
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Diophantine cryptography over infinite groups
- Enhanced matrix power function for cryptographic primitive construction
- Monoidal categories, representation gap and cryptography
- SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA
- Using Semidirect Product of (Semi)groups in Public Key Cryptography
- On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
- Knapsack problems in groups
- Analysis of a key exchange protocol based on tropical matrix algebra
- Algorithmic problems in Engel groups and cryptographic applications
- Algorithmic problems in right-angled Artin groups: complexity and applications
- On Eulerian semigroups of multivariate transformations and their cryptographic applications
- A key exchange protocol using matrices over group ring
- Knapsack problems in products of groups
- Complexity and randomness in group theory. GAGTA book 1
- Some new platforms for algebraic cryptography and one method of increasing the security
- Generic case completeness
- Analysis of secret sharing schemes based on Nielsen transformations
- Cryptanalysis of Cramer-Shoup like cryptosystems based on index exchangeable family
- Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra
- Attack on Kayawood protocol: uncloaking private keys
- Using Decision Problems in Public Key Cryptography
- CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM
- Cryptographic protocols based on inner product spaces and group theory with a special focus on the use of Nielsen transformations
- Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank
- An attack on the Walnut digital signature algorithm
- Title not available (Why is that?)
- Diophantine cryptography in free metabelian groups: theoretical base.
- Group theoretic cryptography
- A nonlinear decomposition attack
- Authenticated commutator key agreement protocol
- The status of polycyclic group-based cryptography: a survey and open problems
- Linear groups and computation
- Solving the conjugacy decision problem via machine learning
- Group-based cryptography
- A short biography of Ben Fine
- 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
- Reidemeister classes and twisted inner representations.
- Search problems in groups and branching processes.
- Cryptanalysis of a key exchange protocol based on the endomorphisms ring \(\mathrm{End}(\mathbb Z_p\times\mathbb Z_{p^2})\)
- LWE from non-commutative group rings
- Linear decomposition method in analyzing hidden information protocols on algebraic platforms
- Undeniable signature scheme based over group ring
- An improved version of the AAG cryptographic protocol
- Conjugacy search problem and the Andrews-Curtis conjecture
- Thompson’s Group and Public Key Cryptography
- Conjugacy systems based on nonabelian factorization problems and their applications in cryptography
- GENERAL ALGEBRAIC CRYPTOGRAPHIC KEY EXCHANGE SCHEME AND ITS CRYPTANALYSIS
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101433)
