StudentShare
Contact Us
Sign In / Sign Up for FREE
Search
Go to advanced search...

Number theory and RSA - Essay Example

Cite this document
Summary
Number Theory and RSA By Instructor Institution State Date Number Theory and RSA Introduction Cryptography is a model different from steganography. Steganography is the process by which communication between individuals is secured through completely hiding the existence of the conversation from uninvolved parties, while cryptography is obscuring or just encrypting the messages in a conversation so that anybody who overhears the conversation cannot understand it…
Download full paper File format: .doc, available for editing
GRAB THE BEST PAPER98.1% of users find it useful
Number theory and RSA
Read Text Preview

Extract of sample "Number theory and RSA"

Download file to see previous pages

At this stage, the message is sent to the recipient, for the receiver to get the clear message, the message is decrypted back to original plaintext. The whole process usually rely on a key, this key give a way to encrypt the message by the sender and a way for the listener to figure out what the message says (decrypt). This can be enabled with the use of the old cryptosystem which used the symmetric keys or the newly and more advanced public key cryptosystem. In symmetric keys one had to possess the key that was used to encrypt the message so as to decrypt back the message at the other end; but for the public key cryptosystem knowing the message does not mean one can decrypt the message (Stinson, 2006).

For example, the trapdoor function; in this idea, a function ? is for encryption, so, to decrypt one has to find the inverse, ; which is difficult to find, this means that even if you have ? and you understand the output is A, it is still hard to find (A). However, if it happens that you know k, (extra piece information that acts as a lever that lets the inverse fall through by opening the trapdoor), then from ?, A and k one can easily come up with (A), so in this system k is kept secret but the whole message can be displayed or heard by anyone and it does not pose any threat because nobody can decrypt the message.

Number Theory In Number theory, theorems have been derived to explain the public key cryptosystem and the key exchange problem (Martin J. Erickson, 2008). Some studies introduce the sage commands to aid in performing basic number theorems such as Euler’s phi function and greatest common divisor. This happens when coding the algorithms and functions, but mathematically it is not a requirement as we will notice in the examples. In definition, integers greater than 1, and their positive divisors are only 1 and itself, then that is a prime number, otherwise if not then it is a composite number (Martin J.

Erickson, 2008). The fundamental theorem of arithmetic is the base equation when dealing with number theory is; n The greatest common divisor of k and m, (gcd (k, m)), is the largest number that can divide both k and m. this two positive integers greater than 0 are relatively prime if gcd (k, m) =1. This can be shown by the extended Euclidian algorithm below (T. H. Cormen, 2001), Input: k, m Output: (d, x, y) subject to d=gcd(k,m) and kx + my = d d=k; t=m; x=1; y=0; r=0; s=1; While (t>0) { q = _d/t_ u=x-qr; v=y-qs; w=d-qt x=r; y=s; d=t r=u; s=v; t=w } return (d, x, y) In the above algorithm, these Invariants were used gcd(k,m)=gcd(d,t) kx + my = d kr + ms = t using the Chinese Reminder Theorem(CRT) (Loxton, 1990), we Let m1, m2, ,,, mk be integers subject to gcd(mi, mj) = 1, i j, and … This means that there exist a unique solution modulo m= and this solution is given by (a1, a2,… ak) = (? ) mod m, Where = m /, and = mod This idea can be proven by these four steps; 1.

Set M = 2. Find such that + = 1(this is a Bezout). 3. Note that = 1 if j?? 4. Therefore, the solution to the system equation becomes: Mentioned above is the Bezout’s Identity, which is a property in the greatest common divisor (Martin J. Erickson, 2008). The Bezout’s identify states that for any two natural numbers k and m, there exist integers x

...Download file to see next pages Read More
Cite this document
  • APA
  • MLA
  • CHICAGO
(“Number theory and RSA Essay Example | Topics and Well Written Essays - 3250 words”, n.d.)
Retrieved from https://studentshare.org/mathematics/1404317-cryptography-and-coding
(Number Theory and RSA Essay Example | Topics and Well Written Essays - 3250 Words)
https://studentshare.org/mathematics/1404317-cryptography-and-coding.
“Number Theory and RSA Essay Example | Topics and Well Written Essays - 3250 Words”, n.d. https://studentshare.org/mathematics/1404317-cryptography-and-coding.
  • Cited: 0 times

CHECK THESE SAMPLES OF Number theory and RSA

Cryptography & Coding

This progress in the technology brings a number of facilities and easiness in every field of life.... Cryptography Author Author Affiliation Date Table of Contents Abstract As the technology advances the need for effective tools and applications also grows.... However, the technology emergence also presents some problems regarding the user data and information security and privacy....
14 Pages (3500 words) Essay

Evaluating Internationalization and Business Strategy of Nokia

Select One of the Locations of the Assigned Multinational Corporation (NOKIA) and Discuss It In Terms Of the Form of Its Internationalisation and Business Strategy, By Using the CSA-FSA Matrix Table of Contents Table of Contents 2 1.... Introduction 3 2.... Form of its Internationalisation and Business Strategy by CSA-FSA Matrix 6 3....
5 Pages (1250 words) Essay

Supply Chain Control by Multinational Companies

The paper "How Does a Multinational Company Maximize Its Competitive Advantage by Controlling Its Supply Chain?... explains that increasing competitiveness of the global organizations has made the SCM process more complicated and effective through which a firm can obtain a competitive advantage....
9 Pages (2250 words) Term Paper

A Critique of One Hundred Percent American Article and Doing Anthropology MIT Anthropology Video

The paper contains a critique of One Hundred Percent American article, Hose Speech is better by Napoli article, Thinking about thinking Howard Gardner article, Doing Anthropology MIT Anthropology video, Two Monkeys Were Paid Unequally video, and The Surprising Truth about what Motivates Us video....
4 Pages (1000 words) Assignment

Acheulean hand axes

Given the above, the author seems to acknowledge the polygenetic theory of evolution that the early man evolved at different places on earth as oppose to mono-genetic theory.... However he later demonstrates that various researches on the Narmada man have been done and in fact he gives a number of examples in relations to this....
2 Pages (500 words) Essay

Final project

hellip; Based on the concepts of number theory, the prime numbers used in RSA cryptosystem can be derived from positive integers n>1 where the For example, 2, 3, 5, 7, 11 and 13 among others (Coutinho, 2009, p.... rsa (Rivest, Adleman and Shamir) cryptosystem is currently one of the most practical and widely used public-key cryptosystems especially in the field of data security.... rsa particularly works by simple mathematical relationships both in key generation, encryption and decryption....
4 Pages (1000 words) Research Paper

The Change Agent in Preventing MRSA Spead

This paper "Leadership and Management theory in Relation to Implementing Change in Preventing the Spread of MRSA Infection" focuses on the fact that back in 1961, hospital-Acquired Methicillin-Resistant Staphylococcus aureus (HA-MRSA) is a predominant nosocomial pathogen  … MRSA is commonly found in hospital settings and health care facilities such as surgical ward, nursing homes and dialysis centres.... As part of going through the main discussion, the significance of Lewin's management theory of change, McGregor's theory, and Lippitt's phases of change theory will be examined in terms of its advantages and disadvantages when applied in the surgical ward....
16 Pages (4000 words) Research Paper
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.
Contact Us