This dissertation contains results of the candidate's research on the generalized discrete logarithm problem (GDLP) and its applications to cryptology, in non-abelian groups. The projective special linear groups PSL(2; p), where p is a prime, represented by matrices over the eld of order p, are investigated as potential candidates for implementation of the GDLP. Our results show that the GDLP with respect to specic pairs of PSL(2; p) generators is weak. In such cases the groups PSL(2; p) are not good candidates for cryptographic applications which rely on the hardness of the GDLP. Results are presented on generalizing existing cryptographic primitives and protocols based on the hardness of the GDLP in non-abelian groups. A special instance of a cryptographic primitive dened over the groups SL(2; 2n), the Tillich-Zemor hash function, has been cryptanalyzed. In particular, an algorithm for constructing collisions of short length for any input parameter is presented. A series of mathematical results are developed to support the algorithm and to prove existence of short collisions. / by Ivana Iliâc. / Thesis (Ph.D.)--Florida Atlantic University, 2010. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2010. Mode of access: World Wide Web. FboU
| Identifer | oai:union.ndltd.org:fau.edu/oai:fau.digital.flvc.org:fau_3978 |
| Contributors | Iliâc, Ivana., Charles E. Schmidt College of Science, Department of Mathematical Sciences |
| Publisher | Florida Atlantic University |
| Source Sets | Florida Atlantic University |
| Language | English |
| Detected Language | English |
| Type | Text, Electronic Thesis or Dissertation |
| Format | vii, 94 p. : ill. (some col.), electronic |
| Rights | http://rightsstatements.org/vocab/InC/1.0/ |
Page generated in 0.0016 seconds