Question

a)  Using the Prime Factorization technique determine whether 173 is a prime. b)  Use the cipher: to decrypt...

a)  Using the Prime Factorization technique determine whether 173 is a prime.

b)  Use the cipher: to decrypt “THAO ALZA”.

Math   Statistics-And-Probability   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Answer a.

The prime numbers are such that they have only two factors present in it. The two factors would be 1 and the original number itself. Hence, we need to find here the numbers which consist of only two factors. This is possible by using a simple method, which is called prime factorisation.

If 173 were not a prime number, then it would be divisible by at least one prime number less than or equal to √173 ≈ 13.2. Since 173 cannot be divided evenly by 2, 3, 5, 7, 11, or 13.

So, 173 = 1 x 173 or 173 x 1

Therefore, factors of 173 = 1, 173

Hence, 173 is a prime number

Answer b. This question cannot be solved since cipher is missing.

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Use the cipher: f(x)=(x+7) mod 26 to decrypt “THAO ALZA”.
Use the cipher: f(x)=(x+7) mod 26 to decrypt “THAO ALZA”.
Find the prime factorization of each of these integers and use each factorization to answer the...
Find the prime factorization of each of these integers and use each factorization to answer the questions posed. The greatest prime factor of 39 is _____.
use Euler's totient and prime factorization. a) how many integers between 1 and 2000 inclusive are...
use Euler's totient and prime factorization. a) how many integers between 1 and 2000 inclusive are relatively prime to 2000? b) how many factors of 2000 are perfect squares?
Discrete Mathematics (a) In the RSA cipher using pq = 77 and e = 7, what...
Discrete Mathematics (a) In the RSA cipher using pq = 77 and e = 7, what should be the value of d? Choose a value for d and explain the reason. (b) Decrypt C = 21 using the RSA setup chosen in (a).
Use C++ to implement the following program about Prime Factorization of a Number. Do BOTH parts...
Use C++ to implement the following program about Prime Factorization of a Number. Do BOTH parts of the problem or you will lose points. Provide comments to explain each step. a. Write a function that takes as a parameter a positive integer and returns a list (array) of the prime factors of the given integer. For example, if the parameter is 20, you should return 2 2 5. b. Write a function that tests the above function by asking the...
Use Playfair cipher to encrypt the plaintext “pink balloon” using the key exam.
Use Playfair cipher to encrypt the plaintext “pink balloon” using the key exam.
A bank is using a=13 and b=8 in affine cipher to encrypt all pin numbers and...
A bank is using a=13 and b=8 in affine cipher to encrypt all pin numbers and send to a customer. A customer received a cipher text 6. What is the plain text pin number ?
This question concerns block cipher modes. We will use a simple affine cipher, which can be...
This question concerns block cipher modes. We will use a simple affine cipher, which can be expressed in C as follows. char cipher(unsigned char block, char key) { return (key+11*block)%256; } Note that the block size is 8 bits, which is one byte (and one ASCII character). We will work with the fixed key 0x08. We now encrypt various plaintexts using modes for this cipher. In every case in which the mode requires an IV, the IV will be 0xAA....
Question2: Alice and Bob use the Diffie-Hellman key exchange technique with a common prime q =...
Question2: Alice and Bob use the Diffie-Hellman key exchange technique with a common prime q = 2 3 and a primitive root a = 5 . a. If Bob has a public key YB = 1 0 , what is Bob’s private key YB? b. If Alice has a public key YA = 8 , what is the shared key K with Bob? c. Show that 5 is a primitive root of 23. (Don’t forget to show your work briefly.)
Use Lenstra's elliptic curve factorization algorithm to factor each of the numbers N using the given...
Use Lenstra's elliptic curve factorization algorithm to factor each of the numbers N using the given elliptic curve E and point P. a) N=26167, E: Y^2=X^3+4X+128, P=(2,12) b) N=1386493, E: Y^2=X^3+3X-3, P=(1,1)
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT