Network Security White Papers

The Discrete Logarithm Problem on Elliptic Curves of Trace One

Overview In this short note we describe an elementary technique, which leads to a linear algorithm for solving the discrete logarithm problem on elliptic curves of trace one. In practice the method described means that when choosing elliptic curves to use in cryptography one has to eliminate all curves whose group orders are equal to the order of the finite field.

Further White Paper Details
PublisherHewlett Packard File FormatHTML & PDF
Date PublishedOctober 1997
FormatWhite Papers   
Topics
  • Featured White Papers
Thin clients switch on digitally excluded

Thin clients switch on digitally excluded

Case study: Digital inclusion project tackles social exclusion in Liverpool more

Renault goes multilingual

Renault goes multilingual

Case study: Translation tech turns docs into 23 languages… more


Quick Sitemap Links: