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..

Are you sure? NetCaptor also uses FGInt to implement its serial number protection and it works.

FGInt works fine

C5E974FFB63D4A3B7717D9CC07AFD194B0B6003668BC7FEAC4EEDD4467BC6C0214394465D55EA0D8A6F5B8E840CE027B7E3E 26AB340E5845650D19685D08177018F6A91F7C08A18693FF7C440FEB70A9056ACCF57A2527CEAB7512A85A5472D7F31D9E39 8EAE6043F8CFD93A0CBB2D04495406A44DD16712CA10C9E9FA6F5E57

yeah, crack me baby , but its possible to replace this key with your own key

Another prog which uses FGInt: FastBrowser Pro.