How does a asymmetric key encryption algorithm maintain a one-way decrypt and encrypt function? [closed]?

You can find a fairly good explanation of public key cryptography here. That doesn't go into much detail about the math involved, since it is quite complex and impossible to explain in simple terms. You might also want to take a look at the answers to this related question: How does two-way asymmetric encryption work?

At the very heart of asymmetric keys there is always some mathematical identity which is computationally intractable. The classic example would be the RSA algorithm. Its mathematical foundation is that there are numbers b, m, n such that (b^m)^n = be (in modular arithmetic).

That is, if be is my message, and if m and n are the two parts of an asymmetric key, then one key can decipher something that the other key encrypted. That is, b^m, and also b^n, serve as cipher texts which can be deciphered by raising them to the respective other power. The reason that those are secure ciphers is that it is computationally infeasible to obtain be from b^m (even if you know the value m*n, which needs to be public, too).

Thus the pairs (m, mn) and (n, mn) constitute an asymmetric key pair. As another example of not knowing a private secret but still sharing another secret between two parties, consider Diffie-Hellman key exchange: Here Alice and Bob keep a secret number x and y, respectively, that nobody else knows. Then Alice tells Bob c^x, and Bob tells Alice c^y, for some public value c.

Now both sides can compute the value c^xy, but neither side knows the other party's secret, nor does any eavesdropper know the value of c^xy. Here the mathematical foundation is that it is computationally infeasible to obtain x from c^x, even if you now c.

Think of it like this. Some mathematical operations are invertible. Consider, for example, the operation "multiplication by a non-zero real number."

Fix a non-real number s and consider the operation f(x) defined by x -> x * s. Then this operation is invertible. In fact, if you take t = 1 / s then the operation g(x) defined by g(x) = x * t has the property that g(f(x)) = x so that f is invertible.

Think of x as the message, s as the public key, f as the encryption algorithm, t as the private key and g as the decryption algorithm. Of course, this is a terrible algorithm, but this is all there is to asymmetric encryption: find a parameterized invertible mathematical operation. The parameter provides the public key, and the "inverse parameter" provides the private key.

Of course, with encryption we want it to be harder to find the inverse. In fact, the mathematics of RSA, the most well-known of the asymmetric key algorithms, are quite sophisticated. It relies on the fact that a certain mathematical problem is thought to be extremely hard.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.