The following pages link to Group-based cryptography (Q925085):
Displayed 27 items.
- Towards an operad-based cryptography: applications of commutative operads (Q323582) (← links)
- Authenticated commutator key agreement protocol (Q338834) (← links)
- A nonlinear decomposition attack (Q338847) (← links)
- Public key protocols over the ring \(E_{p}^{(m)}\) (Q340183) (← links)
- On groups that have normal forms computable in logspace. (Q375212) (← links)
- On the arithmetic of the endomorphisms ring \(\text{End}(\mathbb Z_p\times\mathbb Z_{p^2})\). (Q429750) (← links)
- Affine braid groups: a better platform than braid groups for cryptology? (Q429773) (← links)
- Linear decomposition method in analyzing hidden information protocols on algebraic platforms (Q498303) (← links)
- Authentication schemes from actions on graphs, groups, or rings (Q638486) (← links)
- Compressed word problems in HNN-extensions and amalgamated products (Q639849) (← links)
- Exponentially generic subsets of groups (Q716408) (← links)
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- Reidemeister classes and twisted inner representations. (Q891361) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- An extension of the noncommutative Bergman's ring with a large number of noninvertible elements (Q2254532) (← links)
- Vulnerability of cryptographic primitives based on the power conjugacy search problem in quantum computing (Q2263356) (← links)
- A deterministic worst-case message complexity optimal solution for resource discovery (Q2345458) (← links)
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery (Q2868642) (← links)
- A family of polycyclic groups over which the uniform conjugacy problem is NP-complete (Q2876614) (← links)
- Computational Number Theory and Cryptography (Q2926150) (← links)
- Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← links)
- Generalized Learning Problems and Applications to Non-commutative Cryptography (Q3092369) (← links)
- Asymptotic invariants, complexity of groups and related problems (Q3143713) (← links)
- Using Semidirect Product of (Semi)groups in Public Key Cryptography (Q3188249) (← links)
- Compressed Word Problems in HNN-Extensions and Amalgamated Products (Q3392958) (← links)
- Key exchange protocols over noncommutative rings. The case of (Q4903468) (← links)
- COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS (Q4904513) (← links)