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 4 of 4 for “"Length Based Attack"”.

  1. Exploring platform (semi)groups for non-commutative key-exchange protocols

    … by implementing four different variations of the length-based attack, one of the major attacks for AAG, and submitting polycyclic groups to all four variations with a variety of tests. We note that this is the first time all four variations of the length-based attack are compared side by side. We …

    cuny-grad Repository record for Exploring platform (semi)groups for non-commutative key-exchange protocols (opens in a new tab)

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

    … 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 …

    cuny-grad Repository record for Analysis of a Group of Automorphisms of a Free Group as a Platform for Conjugacy-Based Group Cryptography (opens in a new tab)

  3. Applications of Contracting Self-Similar Groups to Cryptography and Scale Groups

    … groups as a platform for cryptographic schemes based on simultaneous conjugacy search problem (SCSP). This class of groups admits fast polynomial-time algorithms for the word problem and element multiplication that can be used for effective encryption and decryption of messages. It contains …

    usf Repository record for Applications of Contracting Self-Similar Groups to Cryptography and Scale Groups (opens in a new tab)

  4. Solving Algorithmic Problems in Finitely Presented Groups via Machine Learning

    … in the Cayley graph, in what we call regression-based conjugacy search (RBCS). RBCS can be applied to groups such as polycyclic groups for which other heuristic approaches, such as the length-based attack, are ineffective.

    cuny-grad Repository record for Solving Algorithmic Problems in Finitely Presented Groups via Machine Learning (opens in a new tab)