Example of encryption key pair algorithm?

AI Thread Summary
The discussion centers on the concept of encryption and the nature of mathematical operations that are difficult to reverse. It highlights that when data is encrypted using a public key, it can only be decrypted with the corresponding private key, emphasizing the one-way nature of certain mathematical functions. A key example provided is the multiplication of two large prime numbers, which is straightforward to perform but challenging to reverse-engineer to find the original primes from the product. This illustrates the principle of one-way functions, where the operation can be easily executed in one direction but is computationally infeasible to reverse.
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.
 
Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
I had a Microsoft Technical interview this past Friday, the question I was asked was this : How do you find the middle value for a dataset that is too big to fit in RAM? I was not able to figure this out during the interview, but I have been look in this all weekend and I read something online that said it can be done at O(N) using something called the counting sort histogram algorithm ( I did not learn that in my advanced data structures and algorithms class). I have watched some youtube...
Back
Top