Home › Digital Repository › Faculty, Staff and Student Publications/Presentations › Undergraduate Research › Undergraduate Research Day › Undergraduate Research Day 2009 ›

Sieving and Searching for Pseudoprimes

Object Details

View

Title Information
Sieving and Searching for Pseudoprimes

Name:Personal
Peterson, Daniel Role :Text(marcrelator)
creator

Name:Personal
Müller, Dr. Siguna Role :Text(marcrelator)
contributor

typeOfResource
still image genre
Origin Information Place

(keyDate="yes")
2009-05-15

Language:Text

Physical Description

born digtal

abstract
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. note
From - Undergraduate Research Day 2009 - Celebration of Research - Abstracts
Subject
prime factors

Subject
Miller-Rabin statistical primality

Subject
Frobenius statistical primality

Subject
pseudoprime numbers

Subject
hillclimbing heuristics

Related Item:series Title Information
Undergrauate Research Day 2009

Location (usage="primary display")

accessCondition:useAndReproduction
http://digital.uwyo.edu/copyright.htm
Record Information languageOfCataloging :Text(ISO639-2B)
English :Code(ISO639-2B)
eng