# Thread: RSA Encryption Algorithm help

1. ## RSA Encryption Algorithm help

does anyone know how i would encrypt a message using the RSA algorithm.. and them successfully decrypt it to where it is the same message??

For example... i want to send Bob an encrypted message...

1) Convert all character values to integer values
2) Should I keep integer values separate? or together to make it more secret
3) Run integer values through algorithm
4) Decrypt message

<1> A red cat
'A'= 65
' '= 32
'r' = 114
'e' = 101
'd' = 100
' '= 32
'c'= 99
'a'= 97
't= 116

<2> 65 32 114 101 100 32 99 97 116
6532114101100329997116

<3> Encrypts to 123 34 13 532 243 12 43 76 56
123341353224312437656

<4> Decrypt back to orginal values

How in the world is the person decrypting the values going to transfer the integer values back to the character values if they are all jumbled together??

2. u can have them spaced by something like -

or learn how to do trees and put them all into 1s and 0s

edit: i think this is how it could work with all of them jumbled

do something where it cuts the decrypted message number by number, then checks it for the values.
for example

1233413
it would start by cutting it to 1; checks; nothing;
cuts it into 12; checks; nothing;
cuts it into 123; checks; match; store the letter into a string; cut the encrypted message;

Start the loop again.

3. In fact I do. I even have a library I wrote to handle those pesky 100+ digit numbers. But since I already am aware of the fact that you know how to do it (at least on theoretical level) I will just give you a tutorial instead.

http://www.woodmann.com/crackz/Tutorials/Rsa.htm

Just do as you've been doing and stick to smaller numbers to get started.