How Does Number Theory Apply to Cryptography?

  • Context: Undergrad 
  • Thread starter Thread starter poolwin2001
  • Start date Start date
  • Tags Tags
    Cryptography
Click For Summary

Discussion Overview

The discussion centers around the application of number theory in cryptography, with a particular focus on its role in encryption methods such as RSA. Participants explore concepts related to key distribution, one-way functions, and the mathematical foundations necessary for understanding these cryptographic systems.

Discussion Character

  • Exploratory
  • Technical explanation
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • One participant inquires about the connection between number theory and cryptography, specifically mentioning factorization.
  • Another participant introduces the concept of public key encryption and mentions that it is not secure due to its reliance on properties of rings, suggesting that understanding RSA requires knowledge of Euclid's algorithm and group theory.
  • A participant shares a resource link for further reading on RSA encryption.
  • One participant explains that number theory helps solve the key distribution problem by providing a usable "one-way" function for encryption algorithms, while noting that other cryptographic methods may not rely on number theory but face challenges in key transportation and security.
  • This participant also highlights the complexities involved in key management, including the need for periodic key changes to ensure security.
  • There is a suggestion that the explanation of RSA and Euclid's algorithm has not been fully addressed, inviting further contributions from others.

Areas of Agreement / Disagreement

Participants express various viewpoints on the role of number theory in cryptography, with some agreeing on its importance in public key encryption while others note that alternative methods exist. The discussion remains unresolved regarding the completeness of explanations and the intricacies of RSA.

Contextual Notes

Some participants mention prerequisites such as knowledge of Euclid's algorithm and ring theory, indicating that the discussion may depend on these mathematical foundations. There are also references to the limitations of the provided resource in explaining the "how" of RSA.

poolwin2001
Messages
179
Reaction score
0
Number theroy and Cryptography??

I heard that Number theroy has apllication in Cryptography especially the bit about factorisation.How?Can anyone Explain?
Thanks in advance
 
Physics news on Phys.org
the simplest version is public encode/decode, and is not secure because both you and the person you're communicating to can encode and decode, amongst other reasons, and relies on some properties of rings, this isn't what you're asking about but it's a good starting place before you go onto RSA in full since it introduces several things you'll need.

i don't have time right now to answer in full, but if someone wants to post a reply before i get back do so.

or google for details on RSA encryption

you'll need to know about euclid's algorithm, and some basics in ring and group theory would be beneficial, particularly modulo arithemetic and the orders of elements.
 
Thanks
looked it up and found this good site
http://world.std.com/~franl/crypto/rsa-guts.html
 
Last edited by a moderator:
The role that number theory played is that it was used to solve the key distribution problem by providing a usable "one-way" function for the encryption algorithm.

Other forms of cryptography (than RSA or PGP) do not rely on a number theoretic approach, but suffer from the difficulty (and security needed) in transporting keys.

A key is something that allows the recipient to decipher a coded message. If the key is compromised, a whole series of communications may be intercepted. Furthermore, when sending a communication to several locations, the distribution of keys becomes cumbersome. And lastly, to ensure security, it may often be safe to keep changing the key periodically, and that just adds to the complexity of the problem.

Public key encryption avoids these difficulties. And that's what RSA is.


PS : This was just meant to supplement what you got from the link you posted...which seems quite limited in explanation. The "how" of RSA (and of Euclid's algorithm) has not been talked about...I'll pass the baton on to someone else (maybe matt will take it) for that. Or I'll come back to it later.
 
Last edited:

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
6K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K