<?xml version="1.0" encoding="iso-8859-1" ?>
<rss version="2.0">
  <channel>
    <title>2009 Reports</title>
    <link>http://eprint.iacr.org/forum/list.php?9</link>
    <description><![CDATA[Discussion forum for Cryptology ePrint Archive reports posted in 2009.
Please put the report number in the subject.

]]></description>
    <language>EN</language>
    <pubDate>Sat, 02 Jan 2010 04:33:36 -0700</pubDate>
    <lastBuildDate>Sat, 02 Jan 2010 04:33:36 -0700</lastBuildDate>
    <category>2009 Reports</category>
    <generator>Phorum 5.1.22</generator>
    <ttl>600</ttl>
    <item>
      <title>2009/638</title>
      <link>http://eprint.iacr.org/forum/read.php?9,199,199#msg-199</link>
      <author>addyme</author>
      <description><![CDATA[title: Reducing Elliptic Curve Logarithm to Logarithm in a Finite Field $\mathbb{F}_q$ for Some Orders

The authors are proposing an ingenious method to transform ECDLP to DLP. I was attracted and excited. Anyhow, it seems too good to believe.

Suppose large prime integer $N$ and $#E(F_q)=q+1-t=mN$. ECDLP in $N$-torsion subgroup is considered.

Notice that $q-1|q^2-(t-1)^2$ implies $q-1|mNt$.

Two cases follow:
(1) $N |q-1$, then Tate pairing works for such transformation.
(2) $N \nmid q-1$, then $q-1|mt$, which disables newly proposed algorithm in eprint2009/638.

Unfortunately, it gives no new information than available pairings.]]></description>
      <category>2009 Reports</category>
      <guid isPermaLink="true">http://eprint.iacr.org/forum/read.php?9,199,199#msg-199</guid>
      <pubDate>Sat, 02 Jan 2010 04:33:36 -0700</pubDate>
    </item>
  </channel>
</rss>
