gnog
February 26th, 2003, 15:06
Ive looked at the FGInt library for delphi (http://triade.studentenweb.org/GInt/gint.html), which implements big num usage for RSA.
it seems that it doesnt encrypt right, c = m ^ e (mod n) isn't calculated correctly.. anyone else noticed this bug ?
if so, where is the bug in it and how can you fix it?
thanks in advance..
it seems that it doesnt encrypt right, c = m ^ e (mod n) isn't calculated correctly.. anyone else noticed this bug ?
if so, where is the bug in it and how can you fix it?
thanks in advance..