<?xml version="1.0" encoding="iso-8859-1" ?>
<rss version="2.0">
  <channel>
    <title>2011 Reports</title>
    <link>http://eprint.iacr.org/forum/list.php?11</link>
    <description><![CDATA[Discussion forum for Cryptology ePrint Archive reports posted in 2011.
Please put the report number in the subject.]]></description>
    <language>EN</language>
    <pubDate>Wed, 02 Mar 2011 13:57:24 -0700</pubDate>
    <lastBuildDate>Wed, 02 Mar 2011 13:57:24 -0700</lastBuildDate>
    <category>2011 Reports</category>
    <generator>Phorum 5.1.22</generator>
    <ttl>600</ttl>
    <item>
      <title>[2011/044] Another reference</title>
      <link>http://eprint.iacr.org/forum/read.php?11,357,357#msg-357</link>
      <author>cohen082</author>
      <description><![CDATA[Might be worthwhile to compare your method with the one presented below.

A. E. Cohen and K. K. Parhi, &quot;Faster Elliptic Curve Point Multiplication Based on a Novel Greedy Base-2,3 Method,&quot; in Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS), Page(s):3374-3377, May 21-24, 2006]]></description>
      <category>2011 Reports</category>
      <guid isPermaLink="true">http://eprint.iacr.org/forum/read.php?11,357,357#msg-357</guid>
      <pubDate>Wed, 02 Mar 2011 13:57:24 -0700</pubDate>
    </item>
  </channel>
</rss>
