Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 26 results in range #1 to #26.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. A secret sharing scheme based on the Closest Vector Theorem and a modification to a private key cryptosystem: Label: en
  2. On the intersection of subgroups in free groups: Echelon subgroups are inert: Label: en
  3. On the dimension of matrix representations of finitely generated torsion free nilpotent groups: Label: en
  4. Non-associative key establishment for left distributive systems: Label: en
  5. An asymmetric generalisation of Artin monoids: Label: en
  6. Another look at non-uniformity: Label: en
  7. No-leak authentication by the Sherlock Holmes method: Label: en
  8. A Diffie–Hellman key exchange protocol using matrices over noncommutative rings: Label: en
  9. Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography: Label: en
  10. Search and test algorithms for triple product property triples: Label: en
  11. Isomorphism in expanding families of indistinguishable groups: Label: en
  12. Existence, algorithms, and asymptotics of direct product decompositions, I: Label: en
  13. Continuous hard-to-invert functions and biometric authentication: Label: en
  14. Non-commutative digital signatures: Label: en
  15. Cylinders, multi-cylinders and the induced action of Aut(Fn): Label: en
  16. Cyclic rewriting and conjugacy problems: Label: en
  17. On the cogrowth of Thompson's group F: Label: en
  18. Algorithmics on SLP-compressed strings: A survey: Label: en
  19. Equations over groups: Label: en
  20. Public key exchange using matrices over group rings: Label: en
  21. Faithful representations of limit groups II: Label: en
  22. A new algorithm to find apartments in coset geometries: Label: en
  23. Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption: Label: en
  24. Secrecy without one-way functions: Label: en
  25. Generic complexity of the Diophantine problem: Label: en
  26. Shortlex automaticity and geodesic regularity in Artin groups: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)