• Corpus ID: 16982457

A study of Maurer ’ s algorithm for finding provable primes in relation to the Miller-Rabin algorithm

@inproceedings{Schwarz2007ASO,
  title={A study of Maurer ’ s algorithm for finding provable primes in relation to the Miller-Rabin algorithm},
  author={Mathias Schwarz},
  year={2007}
}

Figures from this paper

Calculating Fast Fourier Transform by using parallel software design patterns

The key issues for concurrent calculation of a Fast Fourier Transform are determined at a higher level avoiding low-level patch-ups, and by combining these design patterns, a robust application can be obtained.

References

SHOWING 1-8 OF 8 REFERENCES

Finding primes & proving primality

  • 1.html,
  • 2007

Speeding up Prime Number Generation

This work presents various ways of speeding up the standard methods for generating provable, resp.

Cryptography - theory and practice

  • D. Stinson
  • Computer Science, Mathematics
    Discrete mathematics and its applications series
  • 1995

Average case error estimates for the strong probable prime test

Consider a procedure that chooses k-bit odd numbers independently and from the uniform distribution, subjects each number to t independent iterations of the strong probable prime test (Miller-Rabin

Handbook of Applied Cryptography

From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of

Fast generation of prime numbers and secure public-key cryptographic parameters

  • U. Maurer
  • Mathematics
    Journal of Cryptology
  • 2004
A very efficient recursive algorithm for generating nearly random provable primes is presented. The expected time for generating a prime is only slightly greater than the expected time required for

Finding primes & proving primality. http://primes.utm.edu/prove/prove3 1.html

  • Finding primes & proving primality. http://primes.utm.edu/prove/prove3 1.html
  • 2007

Miller-rabin primality test — wikipedia, the free encyclopedia

  • Miller-rabin primality test — wikipedia, the free encyclopedia
  • 2007