#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2011

2013

- This year (0)
- Last 5 years (4)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

In this paper, we describe a brand new key exchange protocol based on a semidirect product of (semi)groups (more specifically, on extension of a (semi)group by automorphisms), and then focus on practical instances of this general idea. Our protocol can be based on any group, in particular on any non-commutative group. One of its special cases is the… (More)

- Maggie Habeeb, Delaram Kahrobaei, Vladimir Shpilrain
- IACR Cryptology ePrint Archive
- 2012

A (t, n)-threshold secret sharing scheme is a method to distribute a secret among n participants in such a way that any t participants can recover the secret, but no t − 1 participants can. In this paper, we propose two secret sharing schemes using non-abelian groups. One scheme is the special case where all the participants must get together to recover the… (More)

Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diffie-Hellman, and elliptic curve methods are number theory based and hence depend on the structure of abelian groups. The strength of computing machinery has made these techniques theoretically susceptible to attack and hence recently there… (More)

- Maggie Habeeb, Delaram Kahrobaei
- Groups Complexity Cryptology
- 2013

It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into GLn(Z) for an appropriate n ∈ N; that is, each element in the group has a unique matrix representation. An algorithm to determine this embedding was presented in [6]. In this paper, we determine the complexity of the crux of the algorithm and… (More)

A (t, n)-threshold secret sharing scheme is a method to distribute a secret among n participants in such a way that any t participants can recover the secret, but no t − 1 participants can. In this paper, we propose two secret sharing schemes using non-abelian groups. One scheme is the special case where all the participants must get together to recover the… (More)

- ‹
- 1
- ›