dc.contributor.advisor Dalezman, Michael dc.contributor.advisor Teicher, Mina dc.contributor.author Stern, Jacob dc.contributor.author Yeshiva University, degree granting institution. dc.date.accessioned 2020-06-08T18:57:22Z dc.date.available 2020-06-08T18:57:22Z dc.date.issued 2020-05 dc.identifier.citation Stern, Michael. (May 2020). Commutative Subgroup Pairs of B n with Applications for Cryptography. Thesis Submitted in Partial Fulfillment of the Requirements of the Jay and Jeanie Schottenstein Honors Program. Yeshiva College. Yeshiva University, May 2020. en_US dc.identifier.uri https://hdl.handle.net/20.500.12202/5607 dc.description Senior honors thesis. Opt-out. For access, please contact yair@yu.edu en_US dc.description.abstract Cryptography is the science of writing and deciphering code. In the last few years en_US Cyber-Cryptography, or the science of writing and deciphering digital code has become central in our society. Many methods of Cyber-Cryptography are known and used today by some of our most important institutions. One of the most popular methods of Cyber-Cryptography is known as Public Key Cryptography. Many variants of Public Key Cryptography are used today, such as the popular Diffie–Hellman Protocol and the RSA Algorithm. To combat any potential weaknesses alternative Public Key Cryptography methods have been proposed. One of these Methods, known as The Korean Protocol relies heavily on a mathematical structure known as a Braid Group. Underlying the Korean Protocol is the division of a braid group into a pair of commutative subgroups. There is a trivial division of B n into two subgroups, which is what has been traditionally used. A list of all such commutative subgroup pairs would be an invaluable addition to cryptography. We set out to categorize all commutative pairs of subgroups. In the end we were able to create an algorithm that can generate any arbitrary commutative pair of subgroups. dc.description.sponsorship Jay and Jeanie Schottenstein Honors Program en_US dc.language.iso en_US en_US dc.rights Attribution-NonCommercial-NoDerivs 3.0 United States * dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ * dc.subject Senior honors thesis en_US dc.subject Cryptography en_US dc.subject Braid theory. en_US dc.title Commutative Subgroup Pairs of B n with Applications for Cryptography. en_US dc.type Thesis en_US
﻿

### This item appears in the following Collection(s)

Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States