Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Authentication, digital signatures and secret sharing (94A62) Special aspects of infinite or finite groups (20Fxx) Structure and classification of infinite or finite groups (20Exx)
Recommendations
Cited in
(68)- Monoidal categories, representation gap and cryptography
- On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups
- On Eulerian semigroups of multivariate transformations and their cryptographic applications
- Oblivious transfer using non-abelian groups
- Compressed Word Problems in HNN-Extensions and Amalgamated Products
- Complete decomposition of dihedral groups with application to key exchange protocol
- Finitely presented groups. With applications in post-quantum cryptography and artificial intelligence
- Improved parallel algorithms for generalized Baumslag groups
- Applications of group theory in cryptography. Post-quantum group-based cryptography
- AUTHENTICATED TRIPARTITE KEY AGREEMENT PROTOCOL USING DIGITAL SIGNATURE ALGORITHM
- Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank
- Authentication schemes from actions on graphs, groups, or rings
- Reidemeister classes and twisted inner representations.
- Some applications of arithmetic groups in cryptography
- Evolution of group-theoretic cryptology attacks using hyper-heuristics
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
- Graph coloring applied to secure computation in non-abelian groups
- Exponentially generic subsets of groups
- An extension of the noncommutative Bergman's ring with a large number of noninvertible elements
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Vulnerability of cryptographic primitives based on the power conjugacy search problem in quantum computing
- Affine braid groups: a better platform than braid groups for cryptology?
- scientific article; zbMATH DE number 6403891 (Why is no real title available?)
- Key agreement based on automaton groups
- Cryptographic protocols based on inner product spaces and group theory with a special focus on the use of Nielsen transformations
- Partial word and equality problems and Banach densities
- A deterministic worst-case message complexity optimal solution for resource discovery
- Algebraic cryptography: new constructions and their security against provable break
- Diophantine cryptography over infinite groups
- On the algebraic structure of \(E_p^{(m)}\) and applications to cryptography
- Using Semidirect Product of (Semi)groups in Public Key Cryptography
- Group theoretic cryptography
- Group operations and isomorphic relation with the 2-tuple linguistic variables
- On groups that have normal forms computable in logspace.
- On the arithmetic of the endomorphisms ring \(\text{End}(\mathbb Z_p\times\mathbb Z_{p^2})\).
- Ironwood meta key agreement and authentication protocol
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- Cryptosystems using linear groups
- Complexity and randomness in group theory. GAGTA book 1
- Improved asymmetric cipher based on matrix power function with provable security
- Asymptotic invariants, complexity of groups and related problems.
- Key exchange protocols over noncommutative rings. The case of End(\(\mathbb Z_p \times \mathbb Z_{p^{2}}\))
- scientific article; zbMATH DE number 5380260 (Why is no real title available?)
- A family of polycyclic groups over which the uniform conjugacy problem is NP-complete.
- Cryptanalysis of the CLR-cryptosystem
- Is the Data Encryption Standard a Group? (Preliminary Abstract)
- Computational Number Theory and Cryptography
- One-relator quotients of right-angled Artin groups
- CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM
- Two general schemes of algebraic cryptography
- Følner functions and the generic word problem for finitely generated amenable groups
- scientific article; zbMATH DE number 4171062 (Why is no real title available?)
- Towards an operad-based cryptography: applications of commutative operads
- Compressed decision problems for graph products and applications to (outer) automorphism groups.
- Linear decomposition method in analyzing hidden information protocols on algebraic platforms
- Public key protocols over the ring \(E_{p}^{(m)}\)
- Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two
- An improved version of the AAG cryptographic protocol
- A nonlinear decomposition attack
- Authenticated commutator key agreement protocol
- scientific article; zbMATH DE number 7310214 (Why is no real title available?)
- GENERAL ALGEBRAIC CRYPTOGRAPHIC KEY EXCHANGE SCHEME AND ITS CRYPTANALYSIS
- Group theory in cryptography
- Geometry and Combinatorics via Right-Angled Artin Groups
- Interactively secure groups from obfuscation
- Compressed word problems in HNN-extensions and amalgamated products
- On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
- Group ID-based encryption with equality test
This page was built for publication: Group-based cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925085)
