𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of a determinate algorithm for the discrete logarithm

✍ Scribed by V. I. Nechaev

Publisher
SP MAIK Nauka/Interperiodica
Year
1994
Tongue
English
Weight
459 KB
Volume
55
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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