Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Probable prime numbers"”.

  1. Studying the efficiency of the Frobenius primality test

    In mathematics, especially number theory, prime numbers are essential concepts. Prime numbers are used in cryptography as one application. Finding large prime numbers is crucial for cryptographic protocols; to do this, we must be able to tell whether a given number is prime or not. To test whether …

    lethbridge Repository record for Studying the efficiency of the Frobenius primality test (opens in a new tab)