Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Non-Commutative Zero-Knowledge Protocols, Bailey Stewart
Non-Commutative Zero-Knowledge Protocols, Bailey Stewart
Student Research Submissions
We examine zero-knowledge protocols working in non-commutative structures. Specifically, we will discuss the advantages and disadvantages of using invertible elements and elements that have a square root. An adaptation of the zero-knowledge protocol will be presented for working in symmetric groups and monoids of endomorphisms and matrices. Additionally, the security behind these zero-knowledge protocols will be discussed as well as showing different scenarios where invertible elements and elements with squares are vulnerable to attacks.
An Analysis Of Efficiency Measures Of The S/V Zodiac, Henry Darron
An Analysis Of Efficiency Measures Of The S/V Zodiac, Henry Darron
Student Research Submissions
This paper concerns forecasting the performance of the S/V Zodiac, a two-masted schooner operating as a public and private charter vessel out of Bellingham, Washington. Two aspects of performance are discussed, namely the business cycle of the Zodiac and the operating efficiency of the Zodiac. For the business cycle, it is found that the best model for the business cycle is the one-year-ahead plan developed for the vessel in or around November each year. As for the operating efficiency, an original model is developed from techniques used for forecasting power outputs of wind farms and individual wind turbines. …
Non-Commutative Massey-Omura Encryption With Symmetric Groups, Shannon Haley
Non-Commutative Massey-Omura Encryption With Symmetric Groups, Shannon Haley
Student Research Submissions
We introduce two non-commutative variations on the original Massey-Omura encryption system using conjugations in the symmetric group Sn. Patented in 1986, the original system was based on the cyclic group F* of units in a finite field F. In place of the abelian group F*, we will work in the non-abelian group Snusing disjoint permutations as well as maximal abelian subgroups in order to potentially create a more secure system. Introducing the non-abelian group Sn presents the need to create a keyspace of commuting permutations and abelian subgroups of sufficient size. …