This post will provide how to calculate the largest prime number of a 96 bit number. This was chosen as a starting point. As you can see, it took almost 27 minutes (1614 seconds) to calculate on a dual core laptop.<\/p>\n
\r\n>>> import random\r\n>>> random.getrandbits(64)\r\n5586838809177767755L\r\n>>> def calcPrime(n):\r\n... i = 2\r\n... while i * i <= n:\r\n... if n % i:\r\n... i += 1\r\n... else:\r\n... n \/\/= i\r\n... return n\r\n...\r\n>>> calcPrime(random.getrandbits(64))\r\n17132851387L\r\n>>> calcPrime(random.getrandbits(70))\r\n29976485827L\r\n>>> calcPrime(random.getrandbits(80))\r\n83358363197L\r\n>>> import time\r\n>>> t0 = time.time()\r\n>>> calcPrime(random.getrandbits(96))\r\n>>> t1 = time.time()\r\n>>> print t1-t0\r\n1614.5999999\r\n>>>\r\n<\/pre>\nA security algorithm such as RSA uses the largest prime factors of a composite number. As such, you would have to calculate each number for a number much higher than can be stored in 96 bits (roughly 79 octillion); in 2016, 2048 bit encryption is standard.<\/p>\n","protected":false},"excerpt":{"rendered":"
This post will provide how to calculate the largest prime number of a 96 bit number. This was chosen as a starting point. As you can see, it took almost 27 minutes (1614 seconds) to calculate on a dual core…<\/p>\n