Purchase Solution

Prime Numbers in Cryptography

Not what you're looking for?

Ask Custom Question

1. Prime numbers are often used in cryptography. Why do you think prime numbers would be more useful for creating codes than composite numbers?

2. Explain a real-world problem that you used math to solve. What mathematical expressions did you use in your problem-solving? Define your variables and explain your expression.

3. Why is it important to follow the order of operations? What are some possible outcomes when the order of operations is ignored? If you invented a new notation where the order of operations was made clear, what would you do to make it clear?

4. Explain the main differences among integers, rational numbers, real numbers, and irrational numbers. How are these used in everyday life? How would you explain the use of each to someone who did not know about the differences?

Purchase this Solution
Solution Summary

The prime numbers in cryptography is examined.

Solution Preview

1. Prime numbers are often used in cryptography. Why do you think prime numbers would be more useful for creating codes than composite numbers?

Several public-key cryptography algorithms are based on large prime numbers. The term "public key" means that a known or "public" key is used to encode a message and only a recipient who knows the "private" key can decode that message. RSA encryption operates on the belief that it is "computationally infeasible" to factor a compound number that is the product of two large primes (a semiprime). The problem with this belief is that the size of the numbers that are computationally feasible to factor increases significantly as each new generation of computing device is created.

There are no efficient algorithms for finding the prime factors of numbers, so when presented with a very large number that is the product of two large primes, the factorization process takes a very long time - as the number of digits of the primes being factored increases linearly, the number of operations required to perform the factorization on any computer increases exponentially.

Read more:
1. Number Theory - Current Applications - Prime, Message, Composite, and Factors - JRank Articles ...

Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

View More Free Quizzes
Related BrainMass Solutions

  • Public Key Cryptography System

    ,Z ↔ 26, 0 ↔ 30,...,9 ↔ 39 and worked in base 41 to encode this message) 2. RSA in brief We are dealing here with RSA cryptography system.

  • Cryptography : RSA Problem - Public and Private Keys

    17883 Cryptography: RSA Problem - Public and Private Keys Fill in the blank choose public or private. Alice chooses two large prime numbers p and q. She finds their product m = pq, which is _____.

  • Private and Public Key Encryption

    • Choose two distinct prime numbers p and q and calculate n=p*q. n will be used as modulus. • Compute the totient function of n. i.e. Φ(n) = (p-1)(q-1). • We choose e and d such that d= e-1 mod Φ(n).

  • Fermat's little theorem

    Fermat's little theorem, which says that if p is a prime number then (n^p) â?' n is always divisible by p is fundamental to many modern methods of cryptography.

  • Applying Euler's Totient Theory to Cryptography

    382925 Applying Euler's Totient Theory to Cryptography Please show/discuss extensively how number theory is applied in cryptography. Number theory can be applied to public-key system in cryptograph.

  • Cryptography, congruences, and primes

    (see attached) Part I: Prime Numbers (a) By the definition, all the primes in is , which is the set of the multiplications of 2 and an odd integer. (b) Yes.

  • Cryptography : Diffie Helman Key Exchange

    The security of the Diffie Helman Key Exhange depends on the difficulty to compute log(base g)x (mod p) for a large prime g and p. A commom key is found from a Diffie-Helman key exchange. The solution is detailed.

  • Commercial use of strong cryptographic products

    In some countries, even the domestic use of cryptography is, or has been, restricted. Until 1999, France significantly restricted the use of cryptography domestically. In China, a license is still required to use cryptography.

  • Explain the concept of cryptography

    It's a system that encrypts data so two or more entities may communicate in private with secure transmission of data. Cryptography can be used for telephone conversations or computer data transmissions.

View More Related Solutions