Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
(1 point) The Miller-Rabin primality test is based around the following observation. If p is prime and x² = 1 mod p then x = ±1 mod p. Note that x = -1 mod p and x = p-1 mod p mean the same thing. We will use the Miller-Rabin test to test n = = 2353 for primality. To do this we will closely examine an-1 mod n for various integers a. First we divide out all of the 2's from n ― 1. We can write n u = is maximal, and r = 12 where Now we randomly select some a Є Zn, such as a = 1441. Initially we compute ar = mod n. If this number is 1 then the test is inconclusive and another a is selected (up until the number of a's determined by the security level). 2r 4r Otherwise we compute the list of values a²™, a², ..., a²², ..., a²r. Note a²ur Please enter this list for n = = 2353 and a = 1441 in comma separated format. When the list is computed one of a few things could happen. 1) The value 1 never occurs on the list. 2) The value -1 = p-1 mod p occurs on the list, immediately followed by 1. 3) The value 1 occurs in the list, but *not* preceded by -1. Which one of these possibilities holds in our case (enter the number)? What conclusion should we draw from what we have done? 1) n is prime. 2) n is composite. 3) The test is inconclusive.

(1 point) The Miller-Rabin primality test is based around the following observation. If p is prime and x² = 1 mod p then x = ±1 mod p. Note that x = -1 mod p and x = p-1 mod p mean the same thing. We will use the Miller-Rabin test to test n = = 2353 for primality. To do this we will closely examine an-1 mod n for various integers a. First we divide out all of the 2's from n ― 1. We can write n u = is maximal, and r = 12 where Now we randomly select some a Є Zn, such as a = 1441. Initially we compute ar = mod n. If this number is 1 then the test is inconclusive and another a is selected (up until the number of a's determined by the security level). 2r 4r Otherwise we compute the list of values a²™, a², ..., a²², ..., a²r. Note a²ur Please enter this list for n = = 2353 and a = 1441 in comma separated format. When the list is computed one of a few things could happen. 1) The value 1 never occurs on the list. 2) The value -1 = p-1 mod p occurs on the list, immediately followed by 1. 3) The value 1 occurs in the list, but *not* preceded by -1. Which one of these possibilities holds in our case (enter the number)? What conclusion should we draw from what we have done? 1) n is prime. 2) n is composite. 3) The test is inconclusive.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

give the correct answer show all steps, please make sure all answers are correct. 

(1 point) The Miller-Rabin primality test is based around the following observation. If p is prime and x² = 1 mod p then x = ±1 mod p. Note that x = -1 mod p and x = p-1 mod p mean the same thing. We will use the Miller-Rabin test to test n = = 2353 for primality. To do this we will closely examine an-1 mod n for various integers a. First we divide out all of the 2's from n ― 1. We can write n u = is maximal, and r = 12 where Now we randomly select some a Є Zn, such as a = 1441. Initially we compute ar = mod n. If this number is 1 then the test is inconclusive and another a is selected (up until the number of a's determined by the security level). 2r 4r Otherwise we compute the list of values a²™, a², ..., a²², ..., a²r. Note a²ur Please enter this list for n = = 2353 and a = 1441 in comma separated format. When the list is computed one of a few things could happen. 1) The value 1 never occurs on the list. 2) The value -1 = p-1 mod p occurs on the list, immediately followed by 1. 3) The value 1 occurs in the list, but *not* preceded by -1. Which one of these possibilities holds in our case (enter the number)? What conclusion should we draw from what we have done? 1) n is prime. 2) n is composite. 3) The test is inconclusive.
Transcribed Image Text:(1 point) The Miller-Rabin primality test is based around the following observation. If p is prime and x² = 1 mod p then x = ±1 mod p. Note that x = -1 mod p and x = p-1 mod p mean the same thing. We will use the Miller-Rabin test to test n = = 2353 for primality. To do this we will closely examine an-1 mod n for various integers a. First we divide out all of the 2's from n ― 1. We can write n u = is maximal, and r = 12 where Now we randomly select some a Є Zn, such as a = 1441. Initially we compute ar = mod n. If this number is 1 then the test is inconclusive and another a is selected (up until the number of a's determined by the security level). 2r 4r Otherwise we compute the list of values a²™, a², ..., a²², ..., a²r. Note a²ur Please enter this list for n = = 2353 and a = 1441 in comma separated format. When the list is computed one of a few things could happen. 1) The value 1 never occurs on the list. 2) The value -1 = p-1 mod p occurs on the list, immediately followed by 1. 3) The value 1 occurs in the list, but *not* preceded by -1. Which one of these possibilities holds in our case (enter the number)? What conclusion should we draw from what we have done? 1) n is prime. 2) n is composite. 3) The test is inconclusive.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS