Scribd
Upload
168 views9 pages

74 - Miller Rabin Algorithm

The document discusses the Miller Rabin algorithm, which is a probabilistic algorithm used to determine if a number is prime or composite. It works by repeatedly selecting random numbers and testing them against the given number. If the number passes a certain number of tests, it is considered probably prime with high confidence. The algorithm is based on Fermat's Little Theorem and Euler's Criterion from number theory. It has applications in cryptography and computer security due to its speed compared to other primality tests. However, it is not infallible and can produce false positives, and requires many iterations for large numbers, making it computationally expensive.

Uploaded by

Mrudula Bandre
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
168 views9 pages

74 - Miller Rabin Algorithm

The document discusses the Miller Rabin algorithm, which is a probabilistic algorithm used to determine if a number is prime or composite. It works by repeatedly selecting random numbers and testing them against the given number. If the number passes a certain number of tests, it is considered probably prime with high confidence. The algorithm is based on Fermat's Little Theorem and Euler's Criterion from number theory. It has applications in cryptography and computer security due to its speed compared to other primality tests. However, it is not infallible and can produce false positives, and requires many iterations for large numbers, making it computationally expensive.

Uploaded by

Mrudula Bandre
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

BY : - MR UD ULA BAND RE

RO LL NO : - 7 4
BATC H : - A3
Introduction to Miller Rabin Algorithm
Theoretical Basis of Miller Rabin Algorithm
Steps Involved in Miller Rabin Algorithm
Advantages of Miller Rabin Algorithm
Limitations of Miller Rabin Algorithm
 Miller Rabin Algorithm is a probabilistic algorithm used to
determine if a number is prime or composite.
 It was developed by Gary L. Miller and Michael O. Rabin in
1980.
 The algorithm works by repeatedly selecting random
numbers and testing them against the given number. If the
number passes a certain number of tests, it is considered to
be probably prime with a high degree of confidence.
The Miller Rabin Algorithm is based on two
important concepts from number theory:
Fermat's Little Theorem and Euler's
Criterion.
Fermat's Little Theorem states that if p is a
prime number and a is any integer, then
a^p-1 = 1 (mod p). Euler's Criterion states
that if p is an odd prime and a is any integer,
then a^((p-1)/2) = ±1 (mod p).
 This Algorithm can be used to
test high numbers for
primality.
 Because of its advantage in
speed when compared to
other primality tests, Miller
Rabin test will be the test of
choice for several
cryptographic applications.
 The Miller Rabin Algorithm has many
practical applications, including
cryptography, computer security, and
number theory research.
 It is commonly used in RSA
encryption, which is widely used to
secure online transactions and
protect sensitive data.
 Despite its many advantages, the Miller
Rabin Algorithm is not infallible and can
produce false positives for certain values
of n.
 In addition, the algorithm requires a
large number of iterations to achieve a
high level of confidence, which can be
computationally expensive for very large
values of n.
THANK YOU

You might also like