So for my A2 level computing project I'm doing RSA encryption which involves raising large prime numbers to the power of other large prime numbers, however I am a little stuck as the programming lanuage I use (C#) gets stuck at 2^31 like runescape does (hence the max cash stack. I was wondering if there are any other ways around this? I know runescape got stuck again when suomi hit 2^32 total xp and they made a fix for it so did they extend the total xp datatype or what? If anyone has any ideas please feel free to share
01-Dec-2015 13:34:22
