Slashdot Mirror

← Back to Stories (view on slashdot.org)

More on Bernstein's Number Field Sieve

Posted by michael on from the winnow-him-out-'twixt-star-and-star dept.

Russ Nelson writes "Dan Bernstein has a response to Bernstein's NFS analyzed by Lenstra and Shamir, entitled Circuits for integer factorization. He notes that the issue of the cost of factorization is still open, and that it may in fact be inexpensive to factor 1024-bit keys. We don't know, and that's what his research is intended to explore."

1 of 151 comments (clear)

  1. Re:Why? by God!+Awful · · Score: 5, Informative


    I didn't really think there was any need for anything better than 128 bit encryption. It would take a lot of factoring that is practically impossible by human standards to figure out the key for a 32 bit encrypted code, and this site [stack.nl] seems to tell me that 128 bit encryption is nearly impossible to break by any standards.

    128-bit private key encryption is considered virtually unbreakable. 128-bit public key encryption is not. AES is an example of private key encryption; RSA is an example of public key encryption.

    -a

    --
    How to rationalize theft.