Group-based cryptography
From MaRDI portal
Publication:925085
DOI10.1007/978-3-7643-8827-0zbMath1248.94004OpenAlexW4212805042MaRDI QIDQ925085
Alexander Ushakov, Vladimir Shpilrain, Alexei G. Myasnikov
Publication date: 29 May 2008
Published in: Advanced Courses in Mathematics -- CRM Barcelona (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-7643-8827-0
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Special aspects of infinite or finite groups (20Fxx) Structure and classification of infinite or finite groups (20Exx)
Related Items
AUTHENTICATED TRIPARTITE KEY AGREEMENT PROTOCOL USING DIGITAL SIGNATURE ALGORITHM, Geometry and Combinatorics via Right-Angled Artin Groups, Towards an operad-based cryptography: applications of commutative operads, Using Semidirect Product of (Semi)groups in Public Key Cryptography, Authenticated commutator key agreement protocol, A nonlinear decomposition attack, Group operations and isomorphic relation with the 2-tuple linguistic variables, Public key protocols over the ring \(E_{p}^{(m)}\), Computational Number Theory and Cryptography, Følner functions and the generic word problem for finitely generated amenable groups, On groups that have normal forms computable in logspace., Key agreement based on automaton groups, Partial word and equality problems and Banach densities, Graph coloring applied to secure computation in non-abelian groups, Cryptanalysis of the CLR-cryptosystem, Improved asymmetric cipher based on matrix power function with provable security, 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, Monoidal categories, representation gap and cryptography, Improved parallel algorithms for generalized Baumslag groups, On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups, Oblivious transfer using non-abelian groups, On the arithmetic of the endomorphisms ring \(\text{End}(\mathbb Z_p\times\mathbb Z_{p^2})\)., Affine braid groups: a better platform than braid groups for cryptology?, One-relator quotients of right-angled Artin groups, Authentication schemes from actions on graphs, groups, or rings, Compressed word problems in HNN-extensions and amalgamated products, 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, Key exchange protocols over noncommutative rings. The case of, On the algebraic structure of \(E_p^{(m)}\) and applications to cryptography, COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS, An extension of the noncommutative Bergman's ring with a large number of noninvertible elements, Vulnerability of cryptographic primitives based on the power conjugacy search problem in quantum computing, Exponentially generic subsets of groups, Ironwood meta key agreement and authentication protocol, Conjugacy in Baumslag's group, generic case complexity, and division in power circuits, Algebraic cryptography: new constructions and their security against provable break, An improved version of the AAG cryptographic protocol, Generalized Learning Problems and Applications to Non-commutative Cryptography, Evolution of group-theoretic cryptology attacks using hyper-heuristics, Compressed Word Problems in HNN-Extensions and Amalgamated Products, Two general schemes of algebraic cryptography, Unnamed Item, Unnamed Item, Unnamed Item, A deterministic worst-case message complexity optimal solution for resource discovery, A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery, Asymptotic invariants, complexity of groups and related problems, A family of polycyclic groups over which the uniform conjugacy problem is NP-complete
