netcorlib Files

Hello all,

	A few updates. First of all, The main purpose of this library, secure key creation,
has been successfully reached. I am very happy to say that I can finally generate
cryptographically secure keys with this library. With the help of the System.Numerics
namespace, I have been able to successfully use and find prime BigIntegers.

	However, I am still limited to a somewhat large, yet smaller than infinite, key space.
The routines I have provided brute-force search for prime numbers, and in my implementation,
of order 2q+1, where q and 2q+1 are both prime. You can imagine this is difficult to find
where q is very large :). As such, I have provided a sample BigInteger array of pre-generated
values that satisfy the 2q+1 formula. This, as I mentioned above, does limit my keyspace but I 
am heading ever closer in the right direction. Feel free to change the Prime Table to your liking,
as I have provided routines to find q and 2q+1, hint: the function to find q is considerably faster.