|
| Document Title |
Sieving and Searching for Pseudoprimes
|
| Type of Resource |
still image
|
| Date Created |
2009-05-15
|
| Digital Origin |
born digtal
|
| Rights Statement |
http://digital.uwyo.edu/copyright.htm
|
| Keyword (topic) |
prime factors
Miller-Rabin statistical primality
Frobenius statistical primality
pseudoprime numbers
hillclimbing heuristics
|
| Series Title |
Undergrauate Research Day 2009
|
| Creator(s) |
Peterson, Daniel
|
| Contributor(s) |
Müller, Dr. Siguna
|
| Summary |
This presentation details the attempted construction of a highly unlikely composite number, which would be very strong against both the Miller-Rabin and Frobenius statistical primality tests. The construction begins with sieving through numbers in an adaptive way in order to find potentially compatible prime factors of the target composite, and then using local search heuristics (namely hillclimbing) to combine them together in a variety of ways. As this method did not produce the desired results, an exhaustive search on all possible compatible combinations was run, with a disappointing but definitive result.
|
| Notes |
From - Undergraduate Research Day 2009 - Celebration of Research - Abstracts
|
|
|
