Implementing Shamir's secret sharing scheme using floating point arithmetic would provide a faster and more efficient secret sharing scheme due to the speed in which GPUs perform floating point arithmetic. However, with the loss of a finite field, properties of a perfect secret sharing scheme are not immediately attainable. The goal is to analyze the plausibility of Shamir's secret sharing scheme using floating point arithmetic achieving the properties of a perfect secret sharing scheme and propose improvements to attain these properties. Experiments indicate that property 2 of a perfect secret sharing scheme, "Any k-1 or fewer participants obtain no information regarding the shared secret", is compromised when Shamir's secret sharing scheme is implemented with floating point arithmetic. These experimental results also provide information regarding possible solutions and adjustments. One of which being, selecting randomly generated points from a smaller interval in one of the proposed schemes of this thesis. Further experimental results indicate improvement using the scheme outlined. Possible attacks are run to test the desirable properties of the different schemes and reinforce the improvements observed in prior experiments. / by Timothy Finemore. / Thesis (M.S.)--Florida Atlantic University, 2012. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2012. Mode of access: World Wide Web.
| Identifer | oai:union.ndltd.org:fau.edu/oai:fau.digital.flvc.org:fau_3851 |
| Contributors | Finamore, Timothy., Charles E. Schmidt College of Science, Department of Mathematical Sciences |
| Publisher | Florida Atlantic University |
| Source Sets | Florida Atlantic University |
| Language | English |
| Detected Language | English |
| Type | Text, Electronic Thesis or Dissertation |
| Format | ix, 35 p. : ill. (some col.), electronic |
| Rights | http://rightsstatements.org/vocab/InC/1.0/ |
Page generated in 0.0022 seconds