✦ LIBER ✦

The Discrete Logarithm Problem on Elliptic Curves of Trace One

✍ Scribed by N. P. Smart

Publisher: Springer
Year: 1999
Tongue: English
Weight: 31 KB
Volume: 12
Category: Article
ISSN: 0933-2790
DOI: 10.1007/s001459900052

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partial Lifting and the Elliptic Curve D

Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

✍ Qi Cheng; Ming-Deh Huang 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 145 KB

Solving the Multi–discrete Logarithm Pro

Solving the Multi–discrete Logarithm Problems over a Group of Elliptic Curves with Prime Order

✍ Jun Quan Li; Mu Lan Liu; Liang Liang Xiao 📂 Article 📅 2005 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 169 KB

The efficiency of solving multiple discr

The efficiency of solving multiple discrete logarithm problems and the implications for the security of fixed elliptic curves

✍ Yvonne Hitchcock; Paul Montague; Gary Carter; Ed Dawson 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 299 KB

On preconditioners for mortar discretiza

On preconditioners for mortar discretization of elliptic problems

✍ M. Dryja; W. Proskurowski 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

On the min DSS problem of closed discret

On the min DSS problem of closed discrete curves

✍ F. Feschet; L. Tougne 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Given a discrete eight-connected curve, it can be represented by discrete eight connected segments. In this paper, we try to determine the minimal number of necessary discrete segments. This problem is known as the min DSS problem. We propose to use a generic curve representation by discrete tangent

On the low hamming weight discrete logar

On the low hamming weight discrete logarithm problem for nonadjacent representations

✍ J.A. Muir; D.R. Stinson 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 162 KB