Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Polycyclic groups"”.
-
Exploring platform (semi)groups for non-commutative key-exchange protocols
… our collaborator David Garber, and I explore polycyclic groups generated from number fields as platform for the AAG key-exchange protocol. This is done by implementing four different variations of the length-based attack, one of the major attacks for AAG, and submitting polycyclic groups to …
-
Algorithmic properties of poly-Z groups and secret sharing using non-commutative groups
Computational aspects of polycyclic groups have been used to study cryptography since 2004 when Eick and Kahrobaei proposed polycyclic groups as a platform for conjugacy based cryptographic protocols. In the first chapter we study the conjugacy problem in polycyclic groups and construct a family of …
-
A classification of groups satisfying the converse of Lagrange's theorem
This paper is a classification of finite groups satisfying the converse of Lagrange's Theorem. We begin by showing a series of inclusions of classes of finite groups: p-groups {dollar}\subseteq{dollar} nilpotent {dollar}\subseteq{dollar} supersolvable {dollar}\subseteq{dollar} polycyclic …
-
Περί της τομής πεπερασμένα παραγόμενων υποομάδων μίας ομάδας: η ιδιότητα του Howson σε HNN-επεκτάσεις και αμαλγάματα
… theintersection of any two finitely generated subgroups of G is againfinitely generated. This property is «natural» for some classes of groups,such as finite groups and polycyclic groups. Firstly Howson showed thatfree groups have this property. Also free products of Howson groups areHowson. …
-
Solving Algorithmic Problems in Finitely Presented Groups via Machine Learning
… applied to algorithmic problems in free groups. In this dissertation, we seek to extend these techniques to finitely presented non-free groups, in particular to polycyclic and metabelian groups that are of interest to non-commutative cryptography. As a prototypical example, we utilize …
-
Closure and homological properties of (auto)stackable groups
… Brittenham and Hermiller introduced stackable groups in part as a means to gain traction on the word problem for 3-manifold groups. They showed that if graph(&phis;) is (at least) decidable, as a language, then there is an effective algorithm which solves the word problem; furthermore, they …