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

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}
}

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.Expand

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… Expand

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… Expand