Cheat Engine

[NINTENDO]

So asymmetric encryption means that you have different keys for encryption and decryption.

This means that you can send a public key to your friend who can use this key to crypt a message.

Then that friend can send that message back to you and you can decrypt it.

Becuase you are the only one who have the private key you are the only one who can decrypt it. (if no1 else have it and they dont)

Nice but how does it work.

[Stylo]

Exactly as you described.
At first you create 2 keys, a public key and a private key
as you said the public is for encryption and the private for decryption,
you send the public key to whoever want to communicate with you, they then encrypt their message using the public key,
and send it to you.
When you get the message encrypted you and only you decrypt the message using the private key you created with the public key.
Remeber that there is only one private key that can decrypt a message that encrypted with the public key that created with that private key together.

[NINTENDO]

But I meant how the algoritm work

[justa_dude]

The most popular (RSA) uses modpow and depends on the difficulty in factoring large numbers. The others (discrete logs, elliptic curves, etc) use similar schemes - combinations of mathematical operations that are sufficiently difficult to brute-force to be considered one-way operations without a-priori knowledge of the private encryption key.

A formal understanding of the methods involved is kinda' difficult, requiring deep knowledge of discrete maths. Using the algorithms, however, is very simple. Back when Zimmerman was big news and export of encryption was a serious offense, lots of folks were writing very very very small implementations to use as e-mail signatures and tatoos and such (I've seen a three-line RSA implementation in Perl).

Here's a simple five-step process to generate keys, encrypt, and decrypt with RSA. If you Google you can find plenty more.

Cheers,
adude

[Jorg hi]

Algorithms are just based off of logic:
Example of an encryption.

Java, C#, VB6 Pseudo Code.
Function ASCIIEncryption(STRING Input, INTEGER+255 Key)
Variable Output = "";
For [I = 0, I <= Input.Length, I++]{
Output &="[" + (Input.getCharacter(I) * Key^2) + ", " + Input.getCharacter(I).isCapital + "]";
Println "Output: " + Output;
}


Encryption(wWxLIVE,63);

Output: [12033756,false] [12033756,true] [1713600,false] [1388016,true] [1311975,true] [1656956,true] [1406324,true]


@justa_dude - I'm pretty sure Albert Einstein can decrypt RSA.

[Flyte]

[oib111]

[Polynomial]

RSA, like most asymmetric cryptosystems, works using the difficulty of semiprime factorization. A semiprime is any number that is created by multiplying two prime numbers together. Their special property is that their only factors are the two primes used to generate them.

For example, 39803 is a semiprime. Try to calculate the two primes I used to generate it. It's a lot more difficult for you to do that than it was for me to multiply 53 by 751. Now imagine the two primes I used were several hundred digits long - a computer would take forever to bruteforce such numbers.

Essentially RSA converts your plaintext into a number (text and numbers are just bytes when it comes to data) and uses the semiprime factorization problem to securely encrypt your data. It's more complex than a single multiplication, but it's not hugely difficult to understand. Take a look at the Wikipedia page for RSA for more information.

The math behind everything, as justa_dude pointed out, is not so simple. It requires a lot of understanding in the fields of number theorem, statistical analysis, discrete mathematics, etc. You can't just jump in and understand it all without a lot of supporting knowledge.

[NINTENDO]

Thanks everyone =)