Extracting the Modulus from publickeyblob RSA 512

[26B]

Hey guys, I'm just starting out and I've had a really amazing time learning.
I've been able to get the sources up and running on my test box, tests ran were flawless.

So on to my problem :-)

I've got what might be a really simple question.
Looking at my example PUBLICKEYBLOB, I thought to extract the modulus, reverse it then convert to numeric value.
If I've done it correctly, wouldn't this be my result?

11232071749463454753543252651230634613647560303982414229443737647100504614326868158151304468494764052881521121640590698587938838406219182506860563383053539

        static readonly byte[] pbData = new byte[] { 

            // BLOBHEADER
            0x06,                   // PUBLICKEYBLOB
            0x02,                   // CUR_BLOB_VERSION
            0x00, 0x00,             // reserved
            0x00, 0x24, 0x00, 0x00, // CALG_RSA_SIGN

            // RSAPUBKEY
            0x52, 0x53, 0x41, 0x31, // (DWORD magic)  "RSA1" (public key)
            0x00, 0x02, 0x00, 0x00, // (DWORD bitlen) bitlen = 512
            0x01, 0x00, 0x01, 0x00, // (DWORD pubexp) pubExp = 65537
            
             // inverted modulus
            0xE3, 0xEC, 0x11, 0xF1, 0x16, 0x38, 0x20, 0xDA, 
            0xC3, 0xEE, 0x88, 0x8C, 0x06, 0xE6, 0xEF, 0x67, 
            0x09, 0x8A, 0x7D, 0xFB, 0xE1, 0x6F, 0x0A, 0x0E, 
            0x21, 0xD8, 0x0A, 0x1C, 0x4A, 0xE6, 0x4F, 0xA3, 
            0xEE, 0xFC, 0xB9, 0x69, 0xAD, 0x8B, 0xD1, 0xA1, 
            0x3C, 0x06, 0x30, 0x17, 0x57, 0xCA, 0x1D, 0xB1, 
            0xC8, 0x13, 0x01, 0x7D, 0x3B, 0x16, 0x5C, 0x0F, 
            0x72, 0x6B, 0xEC, 0xC1, 0x1B, 0x39, 0x75, 0xD6 
        };

Before I let msieve run for weeks on end.. I'd just like to know that I've converted the modulus correctly.

[TimSorbet]

Originally Posted by 26B

Looking at my example PUBLICKEYBLOB, I thought to extract the modulus, reverse it then convert to numeric value.
If I've done it correctly, wouldn't this be my result?

11232071749463454753543252651230634613647560303982414229443737647100504614326868158151304468494764052881521121640590698587938838406219182506860563383053539

From what I can tell, yes, you converted it correctly. I was able to recreate the same number based on the bytes you gave, and the non-inverted number has many small factors, so it can't be the public key.

Originally Posted by 26B

Before I let msieve run for weeks on end..

While msieve can sieve for NFS, it uses a really slow approach (line sieving) and is not meant for any real-world sieving. You should use the GGNFS sievers (which use lattice sieving) instead. See http://gilchrist.ca/jeff/factoring/n...ers_guide.html (a tutorial that uses Msieve, GGNFS, and factmsieve.py to factor a 100-digit number) http://www.mersenneforum.org/showpos...6&postcount=23 (GGNFS binaries for 64-bit Linux), and http://yafu.sourceforge.net/ (YAFU can be set up to use the GGNFS sievers, like factmsieve.py)

Assuming this is your first GNFS factorization, you might want to start with an easier number, e.g. 100 digits, to get a better working idea of how things work before you commit (and possibly waste) too much time.

[26B]

Thank you very much for the insightful response.
I am using factMsieve.pl that came with the GGNFS source.

Your reply gave me a answers to other questions - so thank you very much for the detailed reply!
I really did appreciate it.