Work

Analysis of a Group of Automorphisms of a Free Group as a Platform for Conjugacy-Based Group Cryptography

Year: 2019

Type: dissertation

Abstract: Let F be a finitely generated free group and Aut(F) its group of automorphisms. In this monograph we discuss potential uses of Aut(F) in group-based cryptography. Our main focus is on using Aut(F) as a platform group for the Anshel-Anshel-Goldfeld protocol, Ko-Lee protocol, and other protocols based on different versions of the conjugacy search problem or decomposition problem, such as Shpilrain-Ushakov protocol. We attack the Anshel-Anshel-Goldfeld and Ko-Lee protocols by adapting the existing types of the length-based attack to the specifics of Aut(F). We also present our own version of the length-based attack that significantly increases the attack' success rate. After discussing attacks, we discuss the ways to make keys from Aut(F) resistant to the different versions of length-based attacks including our own.

Source: CUNY Academic Works (City University of New York)

Author: Pavel Shostak

Language: English

Topic: Cryptography and Data Security

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, City University of New York, Research Foundation of The City University of New York

Awards: II-EN: CUNY Computing Research Infrastructure, G1522395548, G2970038619, MRI: Instrumentation for Enabling Data Analysis, Sharing, Storage, and Preservation, G6871019987, II-EN: City University of New York - Computing Research Infrastructure

OpenAlex ID: W2983786628

Cites: 45

Cited by:

Related to: 10