✦ LIBER ✦

Some soluble cases of the discrete logarithm problem

✍ Scribed by Hans Riesel

Publisher: Springer Netherlands
Year: 1988
Tongue: English
Weight: 704 KB
Volume: 28
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01954904

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Isogenies and the Discrete Logarithm Pro

Isogenies and the Discrete Logarithm Problem in

✍ Benjamin Smith 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 471 KB

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

The Discrete Logarithm Problem on Ellipt

The Discrete Logarithm Problem on Elliptic Curves of Trace One

✍ N. P. Smart 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 31 KB

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

An Improved Pseudo-Random Generator Base

An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem

✍ Rosario Gennaro 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 261 KB

Slope packings and coverings, and generi

Slope packings and coverings, and generic algorithms for the discrete logarithm problem

✍ M. Chateauneuf; A. C. H. Ling; D. R. Stinson 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

## Abstract We consider the set of slopes of lines formed by joining all pairs of points in some subset __S__ of a Desarguesian affine plane of prime order __p__. If all the slopes are distinct and non‐infinite, we have a __slope packing__; if every possible non‐infinite slope occurs, then we have