Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlier… Expand

2011

2009

2009

This paper explores the use of Maple worksheets in a course on modern cryptography for undergraduate sophomores and juniors. The… Expand

2005

2005

When I set out on a book tour to promote the memoir about my less than perfect Texas clan, I did so with soul-sucking dread… Expand

2004

2004

1. Introduction: Efficient Primality Testing.- 2. Algorithms for Numbers and Their Complexity.- 3. Fundamentals from Number… Expand

2004

2004

We introduce primality tests using algebraic groups. Some previously known tests are naturally interpreted as special cases of… Expand

2000

2000

We describe probabilistic primality tests applicable to integers whose prime factors are all congruent to 1 mod r where r is a… Expand

1989

1982

1982

Whether an odd number m is prime can be decided on the knowledge of the image of the function $a \mapsto a^{(m - 1)/2} (m)$. As a… Expand