<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>cryptography on S Anand</title>
    <link>https://www.s-anand.net/blog/tag/cryptography/</link>
    <description>Recent content in cryptography on S Anand</description>
    <generator>Hugo -- 0.164.0</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 23 May 2006 12:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.s-anand.net/blog/tag/cryptography/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Da Vinci Code Quest cracked in 5 minutes</title>
      <link>https://www.s-anand.net/blog/da-vinci-code-quest-cracked-in-5-minutes/</link>
      <pubDate>Tue, 23 May 2006 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/da-vinci-code-quest-cracked-in-5-minutes/</guid>
      <description>&lt;p&gt;Dan cracked the final challenge of the Google Da Vinci Code Quest &lt;a href=&#34;http://dandv.blogspot.com/2006/05/da-vinci-code-quest-final-challenge.html&#34;&gt;in 5 minutes&lt;/a&gt;. The top 10,000 get a cryptex to solve. (&lt;a href=&#34;http://flickr.com/photos/jasonmurphy/tags/cryptex/&#34;&gt;Photos&lt;/a&gt;)&lt;/p&gt;
</description>
    </item>
    <item>
      <title>The Code Book</title>
      <link>https://www.s-anand.net/blog/the-code-book/</link>
      <pubDate>Tue, 27 May 2003 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/the-code-book/</guid>
      <description>&lt;p&gt;&lt;a href=&#34;http://www.amazon.com/exec/obidos/tg/detail/-/0385495323/?tag=sanand-20&#34;&gt;The Code Book by Simon Singh&lt;/a&gt; is the last book I read. It&amp;rsquo;s also the only non-fiction I managed to finish in two years.&lt;/p&gt;
</description>
    </item>
    <item>
      <title>Prime factorisation algorithm</title>
      <link>https://www.s-anand.net/blog/prime-factorisation-algorithm/</link>
      <pubDate>Sun, 10 Nov 2002 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/prime-factorisation-algorithm/</guid>
      <description>&lt;p&gt;An &lt;a href=&#34;http://www.sciencenews.org/20021026/bob9.asp&#34;&gt;update on the IIT-K prime factorisation algorithm&lt;/a&gt;. via Matthai Markose&lt;/p&gt;
</description>
    </item>
    <item>
      <title>Distributed.net cracked RC5-64</title>
      <link>https://www.s-anand.net/blog/distributed-net-cracked-rc5-64/</link>
      <pubDate>Sat, 28 Sep 2002 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/distributed-net-cracked-rc5-64/</guid>
      <description>&lt;p&gt;&lt;a href=&#34;http://www.distributed.net/pressroom/news-20020926.html&#34;&gt;distributed.net cracked RC5-64&lt;/a&gt;. RC5-64 is an &lt;a href=&#34;http://www.rsasecurity.com/news/releases/pr.asp?doc_id=1400&#34;&gt;encryption algorithm developed by RSA&lt;/a&gt;. It took 4 years. It looks long. But the big deal is, the algorithm therefore can&amp;rsquo;t be used for long-term security. More importantly, it&amp;rsquo;s becoming practical to use distributed computing on a massive scale.&lt;/p&gt;
</description>
    </item>
    <item>
      <title>Polynomial time test for primality</title>
      <link>https://www.s-anand.net/blog/polynomial-time-test-for-primality/</link>
      <pubDate>Fri, 09 Aug 2002 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/polynomial-time-test-for-primality/</guid>
      <description>&lt;p&gt;Prof. Manindra Agarwal and his students at IIT-K have figured out a &lt;a href=&#34;http://www.cse.iitk.ac.in/news/primality.html&#34;&gt;polynomial time test for primality&lt;/a&gt;. It was an &lt;a href=&#34;http://www.vacets.org/articles/primality.html&#34;&gt;unsolved problem&lt;/a&gt;. The RSA algorithm assumes that this is impossible. (&lt;a href=&#34;http://www.nytimes.com/2002/08/08/science/08MATH.html&#34;&gt;NYTimes&lt;/a&gt;)&lt;/p&gt;
&lt;p&gt;Of course, &lt;a href=&#34;http://www.meganet.com/news/press/pressrelease12-30-98.htm&#34;&gt;others&lt;/a&gt; have claimed the same. To my knowledge, none is conclusively proven.&lt;/p&gt;
&lt;p&gt;What if they&amp;rsquo;re true? Well, in a few years, our cryptography algorithms will be useless. So it&amp;rsquo;s back to the drawing board, with security-related dot-coms from Univs popping up.&lt;/p&gt;
</description>
    </item>
    <item>
      <title>DeCSS haikus</title>
      <link>https://www.s-anand.net/blog/decss-haikus/</link>
      <pubDate>Sat, 12 Jan 2002 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/decss-haikus/</guid>
      <description>&lt;p&gt;A truly inspired way of describing DeCSS: &lt;a href=&#34;http://www-2.cs.cmu.edu/~dst/DeCSS/Gallery/decss-haiku.txt&#34;&gt;DeCSS haikus&lt;/a&gt;. (I hope linking to it is not illegal.)&lt;/p&gt;
</description>
    </item>
    <item>
      <title>Morse code translator</title>
      <link>https://www.s-anand.net/blog/morse-code-translator/</link>
      <pubDate>Tue, 11 Dec 2001 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/morse-code-translator/</guid>
      <description>&lt;p&gt;.- - .-.. .- &amp;hellip; - a &lt;a href=&#34;http://www.cyberscout.org/roland/normal/train/sea/morse/morset.html&#34;&gt;morse code translator&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
    <item>
      <title>Knee-jerk reactions to Sep 11</title>
      <link>https://www.s-anand.net/blog/knee-jerk-reactions-to-sep-11/</link>
      <pubDate>Thu, 11 Oct 2001 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/knee-jerk-reactions-to-sep-11/</guid>
      <description>&lt;p&gt;A good report on the &lt;a href=&#34;http://www.counterpane.com/crypto-gram-0109a.html&#34;&gt;knee-jerk reactions&lt;/a&gt; to the WTC attack.&lt;/p&gt;
</description>
    </item>
    <item>
      <title>Edgar Allen Poe puzzle solved</title>
      <link>https://www.s-anand.net/blog/edgar-allen-poe-puzzle-solved/</link>
      <pubDate>Sat, 09 Dec 2000 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/edgar-allen-poe-puzzle-solved/</guid>
      <description>&lt;p&gt;Edgar Allen Poe&amp;rsquo;s &lt;a href=&#34;http://www.bokler.com/eapoe_challengesolution.html&#34;&gt;150 year old puzzle has been solved&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
  </channel>
</rss>
