Example of encryption key pair algorithm?

Click For Summary
SUMMARY

The discussion centers on the concept of public key encryption, specifically how data encrypted with a public key can only be decrypted using the corresponding private key. The participants highlight the mathematical principle behind one-way functions, using the example of multiplying two prime numbers. While the multiplication is straightforward, reversing the operation to find the original prime factors is computationally challenging, particularly with large numbers. This illustrates the foundational concept of asymmetric encryption and its reliance on one-way functions for security.

PREREQUISITES
  • Understanding of public key cryptography
  • Familiarity with one-way functions
  • Basic knowledge of prime numbers and multiplication
  • Concept of asymmetric encryption algorithms
NEXT STEPS
  • Research RSA encryption and its mathematical foundations
  • Explore the concept of one-way functions in cryptography
  • Learn about the difficulty of factorization in large integers
  • Investigate other asymmetric encryption algorithms like ECC (Elliptic Curve Cryptography)
USEFUL FOR

This discussion is beneficial for cryptographers, software developers working on secure communications, and anyone interested in understanding the principles of encryption and data security.

CosmicVoyager
Messages
164
Reaction score
0
Greetings,

I know that when encrypting something with the public key of a key pair, the encrypted data can only be decrypted with the private key of the pair. And it can not be decrypted with the public key that was just used.

I do not understand how it is possible to perform a mathematical operation on a number, but then not be able to reverse the operation to get the original value.

How is it that, knowing exactly what operations were performed, you can not undo them and get the original value?

Can someone give a very simple example of such an operation?

Thanks
 
Last edited:
Technology news on Phys.org
You might try reading One-way function. A simple example: multiplying two prime numbers together is easy, but if you are given the product and asked to find the two prime factors it is very difficult (i.e. takes a long time) if the number is a very, very large one.
 

Similar threads

Replies
17
Views
1K
  • · Replies 17 ·
Replies
17
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
45
Views
7K
Replies
14
Views
3K
Replies
5
Views
692
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K