You are here

FAU Collections » FAU Research Repository » FAU Theses and Dissertations

New Results in Group Theoretic Cryptology

Download pdf | Full Screen View

Date Issued:
2006
Summary:
With the publication of Shor's quantum algorithm for solving discrete logarithms in finite cyclic groups, a need for new cryptographic primitives arose; namely, for more secure primitives that would prevail in the post-quantum era. The aim of this dissertation is to exploit some hard problems arising from group theory for use in cryptography. Over the years, there have been many such proposals. We first look at two recently proposed schemes based on some form of a generalization of the discrete logari thm problem (DLP), identify their weaknesses, and cryptanalyze them. By applying the exper tise gained from the above cryptanalyses, we define our own generalization of the DLP to arbitrary finite groups. We show that such a definition leads to the design of signature schemes and pseudo-random number generators with provable security under a security assumption based on a group theoretic problem. In particular, our security assumption is based on the hardness of factorizing elements of the projective special linear group over a finite field in some representations. We construct a one-way function based on this group theoretic assumption and provide a security proof.
Title: New Results in Group Theoretic Cryptology.
94 views
19 downloads
Name(s): Sramka, Michal
Florida Atlantic University, Degree grantor
Magliveras, Spyros S., Thesis advisor
Charles E. Schmidt College of Science
Department of Mathematical Sciences
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Date Created: 2006
Date Issued: 2006
Publisher: Florida Atlantic University
Place of Publication: Boca Raton, Fla.
Physical Form: application/pdf
Extent: 78 p.
Language(s): English
Summary: With the publication of Shor's quantum algorithm for solving discrete logarithms in finite cyclic groups, a need for new cryptographic primitives arose; namely, for more secure primitives that would prevail in the post-quantum era. The aim of this dissertation is to exploit some hard problems arising from group theory for use in cryptography. Over the years, there have been many such proposals. We first look at two recently proposed schemes based on some form of a generalization of the discrete logari thm problem (DLP), identify their weaknesses, and cryptanalyze them. By applying the exper tise gained from the above cryptanalyses, we define our own generalization of the DLP to arbitrary finite groups. We show that such a definition leads to the design of signature schemes and pseudo-random number generators with provable security under a security assumption based on a group theoretic problem. In particular, our security assumption is based on the hardness of factorizing elements of the projective special linear group over a finite field in some representations. We construct a one-way function based on this group theoretic assumption and provide a security proof.
Identifier: FA00000878 (IID)
Degree granted: Dissertation (Ph.D.)--Florida Atlantic University, 2006.
Collection: FAU Electronic Theses and Dissertations Collection
Note(s): Includes bibliography.
Charles E. Schmidt College of Science
Subject(s): Group theory
Mathematical statistics
Cryptography
Combinatorial designs and configurations
Data encryption (Computer science)
Coding theory
Held by: Florida Atlantic University Libraries
Persistent Link to This Record: http://purl.flvc.org/fau/fd/FA00000878
Sublocation: Digital Library
Use and Reproduction: Copyright © is held by the author with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Host Institution: FAU
Is Part of Series: Florida Atlantic University Digital Library Collections.