<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Splitting Messages for RSA</title><link>http://blogs.msdn.com/drnick/archive/2006/09/18/splitting-messages-for-rsa.aspx</link><description>For your particular pair of RSA primes, there is a fixed size to the messages that can be encrypted with the product, n, of those primes. During decryption, you will always end up with the smallest positive integer message that satisfies the algorithm.</description><dc:language>en</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>myITforum Daily Newsletter; September 18, 2006</title><link>http://blogs.msdn.com/drnick/archive/2006/09/18/splitting-messages-for-rsa.aspx#760760</link><pubDate>Mon, 18 Sep 2006 16:31:28 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:760760</guid><dc:creator>myITforum Newsletters</dc:creator><description>myITforum Daily Newsletter Daily Newsletter September 18, 2006 The myITforum.com newsletter is delivered</description></item><item><title>Using RSA for Sending Messages</title><link>http://blogs.msdn.com/drnick/archive/2006/09/18/splitting-messages-for-rsa.aspx#760898</link><pubDate>Mon, 18 Sep 2006 18:47:18 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:760898</guid><dc:creator>Nicholas Allen's Indigo Blog</dc:creator><description>One of the key points made about the Diffie-Hellman algorithm is that it doesn’t actually allow you to...</description></item><item><title>Interesting Finds: September 18, 2006</title><link>http://blogs.msdn.com/drnick/archive/2006/09/18/splitting-messages-for-rsa.aspx#761464</link><pubDate>Tue, 19 Sep 2006 05:36:48 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:761464</guid><dc:creator>Jason Haley</dc:creator><description /></item><item><title>Nicholas Allen's Indigo Blog : Using RSA for Signing Messages</title><link>http://blogs.msdn.com/drnick/archive/2006/09/18/splitting-messages-for-rsa.aspx#763440</link><pubDate>Wed, 20 Sep 2006 12:10:02 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:763440</guid><dc:creator>Nicholas Allen's Indigo Blog : Using RSA for Signing Messages</dc:creator><description>PingBack from &lt;a rel="nofollow" target="_new" href="http://blogs.msdn.com/drnick/archive/2006/09/19/761726.aspx"&gt;http://blogs.msdn.com/drnick/archive/2006/09/19/761726.aspx&lt;/a&gt;</description></item><item><title>Math Behind the RSA Algorithm</title><link>http://blogs.msdn.com/drnick/archive/2006/09/18/splitting-messages-for-rsa.aspx#773933</link><pubDate>Wed, 27 Sep 2006 19:03:44 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:773933</guid><dc:creator>Nicholas Allen's Indigo Blog</dc:creator><description>This post is to tie up some loose ends in regards to actually performing the RSA computations. &amp;nbsp;I've...</description></item><item><title>Math Behind the RSA Algorithm</title><link>http://blogs.msdn.com/drnick/archive/2006/09/18/splitting-messages-for-rsa.aspx#837013</link><pubDate>Wed, 18 Oct 2006 02:33:55 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:837013</guid><dc:creator>Nicholas Allen's Indigo Blog</dc:creator><description>&lt;p&gt;This post is to tie up some loose ends in regards to actually performing the RSA computations. I've avoided&lt;/p&gt;
</description></item><item><title>Using RSA for Signing Messages</title><link>http://blogs.msdn.com/drnick/archive/2006/09/18/splitting-messages-for-rsa.aspx#837018</link><pubDate>Wed, 18 Oct 2006 02:34:13 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:837018</guid><dc:creator>Nicholas Allen's Indigo Blog</dc:creator><description>&lt;p&gt;A nice property of RSA is that if we swap the role of the encryption and decryption keys, it's still&lt;/p&gt;</description></item></channel></rss>