   Huge Number Class
  Hi all,while learning and reading stuff on encryption i found out that they use prime numbers with 100 digits. Some basic calculations showed that i need a variable with 300 bits to process this number.So i thought of making an array of bits, likea[300] and build a class on top of it that handles *-+/ and other operations, so that i can manipulate it like a normal number (int for example).Where can i find info on coding basic basic binary operations? (*/+-)Thanx,   [Hugo Ferreira][Positronic Dreams]I Am Digerati.
  well its been done before (check out the GNU MP library)although ive never been using it ;  Knuth talks extensively about this in one of his books. ;  Well if you are bored/interested in making one your self here''s a little help to get you started. ;  I just wanted to point out that when doing RSA (and by consequence doing large numbers to large powers mod something) using custom data types and lots of memory, while works, isn''t your only option. You can also use algorithms such as Square and Multiply (http://faculty.knox.edu/jdooley/Courses/cs395/Homework/SquareMultiply.html) which is used to compute x^b (mod n). Sorry the linked page isn''t too clear, a better explanation is in the book Cryptography: Theory and Practice by Stinson (a highly reccomended book, but it takes a fair amount of mathematical maturity).