Give an example of how prime numbers are used in encryption.  Remember, state your source.  To answer this one, please EDIT the page.  Don't forget to SAVE when done. 

Note: Using the bc program on UNIX, 2^128 = 340,282,366,920,938,463,463,374,607,431,768,211,456.  A 39 digit number.

"When multiplied together, two prime numbers will yield a product that is only divisible by one and itself – and those two prime numbers. These prime numbers are used in a complex algorithm to scramble (encrypt) a message or file. Thereafter, the two prime numbers are needed again in order to unscramble (decrypt) the message or file.

Size of the Prime Numbers- The size of prime numbers used dictate how secure the encryption will be. A message encrypted with prime numbers that are 5 digits in length (40-bit encryption) yields about 1.1 trillion possible results. A message encrypted with prime numbers that are 7 digits in length (56-bit encryption) yields about 72 quadrillion possible results.  However using 128-bit encryption (16 digit numbers) yields 340,282,366,920,938,463,463,374,607,431,768,211,456 possible results. Mathematically, It would take a super computer testing 100 billion passwords per second, 107,829 billions years to break 128-bit encryption using brute force. (Today’s fastest chips can handle about 256 million encryptions per second.)"

From http://www.cpaadvisor.us/sub/8_encryption.htm. The web site is owned and maintained by Accounting Software Advisor, LLC. In the "About Us" section, the website lists a mission statement which states "Our mission is to deliver accurate information and opinions regarding the top accounting software products in an unbiased manner"

Winner: Cameron. 

 Create your own educational wiki!HelpPublic, not yet premium Privacy Policy RSS