(khos) the title is encrypted by cesar
hello how r u
first i want to say this is really a wonderfull site
second and its the reason that i visit this site that im not a good programmer at all ,but i have a reasearch to do about encryption using the exponential functions and that need a C++ program .
so if anyone here can help and sure want to help plz answer me
thx for ur time reading this .
first i want to say this is really a wonderfull site
second and its the reason that i visit this site that im not a good programmer at all ,but i have a reasearch to do about encryption using the exponential functions and that need a C++ program .
so if anyone here can help and sure want to help plz answer me
thx for ur time reading this .
Last edited on
What a way to get "help" into your topic title...
In any case, this topic seems really general and to be honest I have no idea what kind of answer you want.
In any case, this topic seems really general and to be honest I have no idea what kind of answer you want.
can i see ur message as follow:
oh hello dear do u need any help?
ok in case of yes the help i need is in that algorithem the cipher text is so huge size cause i use this : Cipher=EXP(a*plain + b ) ; a,b are keys which must be at least 56bits
as u see the result is so huge cause we encrypt here a char by char not blocks so after doing the mod process to get back to the ascii values (cause they want the cipher as chars not numbers) how i can keep the result of the process
7mod2=1 but i need the result 3 for the decryption because [ plain=(ln(cipher) - b)/a ] the result maybe so so so so big i dont know how to deal with this problem. i hope u get what i mean cause my english isnt good enough and the problem deserve words more than just these what ever thx for ur time and i ll be gratfull for any kind of help even if the help was wishing a good luck
oh hello dear do u need any help?
ok in case of yes the help i need is in that algorithem the cipher text is so huge size cause i use this : Cipher=EXP(a*plain + b ) ; a,b are keys which must be at least 56bits
as u see the result is so huge cause we encrypt here a char by char not blocks so after doing the mod process to get back to the ascii values (cause they want the cipher as chars not numbers) how i can keep the result of the process
7mod2=1 but i need the result 3 for the decryption because [ plain=(ln(cipher) - b)/a ] the result maybe so so so so big i dont know how to deal with this problem. i hope u get what i mean cause my english isnt good enough and the problem deserve words more than just these what ever thx for ur time and i ll be gratfull for any kind of help even if the help was wishing a good luck
Last edited on
Topic archived. No new replies allowed.