<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Secure Send &#187; Mathematics</title>
	<atom:link href="http://ssend.com/blog/category/mathematics/feed/" rel="self" type="application/rss+xml" />
	<link>http://ssend.com</link>
	<description>SSend.com</description>
	<lastBuildDate>Fri, 03 Feb 2012 06:24:41 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>RSA cryptography question?</title>
		<link>http://ssend.com/blog/rsa-cryptography-question/</link>
		<comments>http://ssend.com/blog/rsa-cryptography-question/#comments</comments>
		<pubDate>Sun, 17 Oct 2010 12:22:54 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Alice]]></category>
		<category><![CDATA[Private Key]]></category>
		<category><![CDATA[Public Key]]></category>
		<category><![CDATA[Restriction]]></category>

		<guid isPermaLink="false">http://ssend.com/blog/rsa-cryptography-question/</guid>
		<description><![CDATA[geoff asked: Alice wants to send a message to Bob securely, using the RSA cryptosystem. Explain how this works (you do not have to justify related theorems), by considering an example where the public key is (n, e) = (77, 5). More specically, and the private key, and explain the decryption/encryption process for each message [...]]]></description>
			<content:encoded><![CDATA[<div style="float:left;padding: 12px"><a href="/files/cc/send_securely23.jpg"><img src="/files/cc/send_securely23.jpg" title='send securely' alt='send securely' /></a></div>
<div><em><strong>geoff</strong> asked: </em></p>
<p>Alice wants to send a message to Bob securely, using<br />
the RSA cryptosystem. Explain how this works (you do<br />
not have to justify related theorems), by considering an<br />
example where the public key is (n, e) = (77, 5). More<br />
specically, and the private key, and explain the decryption/encryption process for each message 1 &lt;= P &lt;= 77.<br />
Is there a restriction on the message P that Alice can<br />
send? (P, 77) = 1.</p>
</div>
]]></content:encoded>
			<wfw:commentRss>http://ssend.com/blog/rsa-cryptography-question/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Challenging Question?</title>
		<link>http://ssend.com/blog/challenging-question/</link>
		<comments>http://ssend.com/blog/challenging-question/#comments</comments>
		<pubDate>Sat, 01 Aug 2009 03:02:48 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Golden Statue]]></category>
		<category><![CDATA[Hotels]]></category>
		<category><![CDATA[Suit Case]]></category>

		<guid isPermaLink="false">http://ssend.com/blog/challenging-question/</guid>
		<description><![CDATA[sheriefhalawa asked: Me and my friend have reserved rooms in hotels. I want to handle him golden statue. Both me and him have 1 suit case, 1 lock and 1 key each (each one&#8217;s key is for his own lock). We are not allowed to leave our rooms but we are allowed to send each [...]]]></description>
			<content:encoded><![CDATA[<div style="float:left;padding: 12px"><a href="/files/cc/send_securely64.jpg"><img src="/files/cc/send_securely64.jpg" alt='send securely' /></a></div>
<div><em><strong>sheriefhalawa</strong> asked: </em></p>
<p>Me and my friend have reserved rooms in hotels. I want to handle him  golden statue. Both me and him have 1 suit case, 1 lock and 1 key each (each one&#8217;s key is for his own lock). We are not allowed to leave our rooms but we are allowed to send each other things via the room handlers, which are not trust-worthy. If they see a golden statue, they steal it. If they see a key, they make themselves identical copies of it. Is there someway using some sequence of transactions that I can transfer the statue securely to my friend? (A golden statue for the best answer <img src='http://ssend.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p><a href=''></a></div>
]]></content:encoded>
			<wfw:commentRss>http://ssend.com/blog/challenging-question/feed/</wfw:commentRss>
		<slash:comments>8</slash:comments>
		</item>
	</channel>
</rss>

