What does this mean for the world of cryptography?

This is a discussion on What does this mean for the world of cryptography? within the A Brief History of Cprogramming.com forums, part of the Community Boards category; Some dudes in India recently developed an algorithm to test for the primality of arbitrarily large numbers with a polynomial-time ...

  1. #1
    Registered User hk_mp5kpdw's Avatar
    Join Date
    Jan 2002
    Location
    Northern Virginia/Washington DC Metropolitan Area
    Posts
    3,788

    What does this mean for the world of cryptography?

    Some dudes in India recently developed an algorithm to test for the primality of arbitrarily large numbers with a polynomial-time algorithm. Check here for a link to the site. My question is does this render more commonplace computer systems/networks capable of breaking encrypted data that was traditionally left to the realm of supercomputers using less efficient algorithms? You can download a PDF file from the website, it explains the algorithm and the math behind it.
    "Owners of dogs will have noticed that, if you provide them with food and water and shelter and affection, they will think you are god. Whereas owners of cats are compelled to realize that, if you provide them with food and water and shelter and affection, they draw the conclusion that they are gods."
    -Christopher Hitchens

  2. #2
    Its not rocket science vasanth's Avatar
    Join Date
    Jan 2002
    Posts
    1,683
    well India rules

  3. #3
    Code Monkey Davros's Avatar
    Join Date
    Jun 2002
    Posts
    812
    Not an issue for cyptography.

    The indian method allows for a relatively quick test of prime with 100% certaintity. There are already formulas to determine whether a number is probably prime (i.e. to within a 99% certaintity or higher). But previously, to be absolutely sure, you would have to employ a time consuming proof.

    If someone were to come up with a really quick way a generating huge prime numbers, then that would be a serious issue.

  4. #4
    Registered User red_baron's Avatar
    Join Date
    May 2002
    Posts
    274
    they call that simple proof??? today at school we learned what if and only if is... suddenly this
    ¿Red Baron?

    "Imagination is more important than knowledge"
    -Albert Einstein (1879-1955)

    Check out my games!

    [code] /* dont forget code tags! */ [/code]

  5. #5
    Its not rocket science vasanth's Avatar
    Join Date
    Jan 2002
    Posts
    1,683
    well to generate a big nos... well my technique does not work 100% for numbers bigger than 5000 but say 60% and may be around 20 % for bigger number



    3 is a prime number 3 x 3 =9

    so the result 9 - 2 = 7 where 7 is a prime number

    same way 7 x 7 = 49 where 7 is a prime number

    the result 49 - 2 = 47 which is a prime number


    this happens for most numbers but not for bigger ones... So is there any way of refining this.. .....

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Replies: 16
    Last Post: 11-23-2007, 12:48 PM
  2. The 7 New Wonders of the World
    By Mario F. in forum A Brief History of Cprogramming.com
    Replies: 36
    Last Post: 12-08-2006, 12:55 PM
  3. Obfuscated Code Contest: The Results
    By Stack Overflow in forum Contests Board
    Replies: 29
    Last Post: 02-18-2005, 04:39 PM
  4. Converting from Screen to World Coordinates
    By DavidP in forum Game Programming
    Replies: 9
    Last Post: 05-11-2004, 12:51 PM
  5. Too much to ask ?
    By deflamol in forum C Programming
    Replies: 2
    Last Post: 05-06-2004, 04:30 PM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21