This Space Intentionally Left Blank

23 Floréal CCXII (May 11, 2004)

(System Stuff) S = (M)d mod n

The observant reader may have noticed that my last comment appeared with a new link beside it, one that said 'PGP'.  The curious would have noticed that clicking on it gives them a clear-signed version of the message in question.  The just plain nosey would have noticed that there's a new <link rel> on the index file to this site that points to a GPG public key.  Now, what does this all mean?  It means that I've been allowed near a list of Movabletype plugins.

There's a whole bunch installed, most of which are fairly subtle, such as Numbers, AbbrevAllev, and Amputator; others, such as Revision have since been removed since they didn't want to work.  Finally, there's the ones like OpenPGPComment, which provides a framework for PGP signed comments, that should be immediately noticable.

Now, those of you who don't go through phases where you suddenly use GPG or PGP and then get bored with it don't have to worry.  This isn't some Typekey wannabe.  It remains possible to post without having the message digitally signed.  In fact, as of right now it is up to the end user to check to see if the signature is authentic.  It is possible to do the latter automatically however, from my past experiences, I've found that SPARC CPUs (at the least the 32-bit ones) tend to be dog slow at these operations.  So, it's really just another one of these toys that I play with.

Two points and a letter from either Alice or Bob for the title.

Posted by g026r at 11:38
Comments

What?  I'm the only person who's ever done a cryptography/cryptoanalysis course?  (Two, in fact, one undergrad and one graduate.)

The title to this is the RSA algorithm for digitally signing a message M.

M is the message, d and n, when used together, are the private key, and S is the message to be sent.  To decrypt you use M = (S)e mod n, where  e, when combined with n, is the public key.  In both of these cases n = p * q, where p and q are two large primes, and e = d-1 mod((p-1)(q-1)).

Siteicon Posted by g026r at 25 Floréal CCXII 16:20 (2004/05/13) PGP

So it's possible that I learned that.  But it's probable that I forgot.  I don't have anything important enough to bother encrypting :)

Posted by peter at 25 Floréal CCXII 21:11 (2004/05/13)

I just remembered it because a) I was required to do it by hand for small primes in each course, and b) it's so simple on paper.

Siteicon Posted by g026r at 25 Floréal CCXII 21:31 (2004/05/13) PGP

I knew that.  But I was in LA, DAMMIT!!!

Posted by Derek at 27 Floréal CCXII 23:51 (2004/05/15)

Hey, you got to go to E3.  I think that more than makes up for missing a point. : P

Siteicon Posted by g026r at 28 Floréal CCXII 08:18 (2004/05/16) PGP
Post a comment







Past Entries

Past Entries