Special number field sieve
Integer factorization is a problem not yet solved for arbitrary integers. Huge integers are therefore widely used for encrypting, e.g. in the RSA encryption scheme. The special number field sieve holds the current factorization record for factoring the number 2^(1039)+1. The algorithm depends on ari...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Norges teknisk-naturvitenskapelige universitet, Institutt for matematiske fag
2008
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9691 |