Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

ANTS
2010
Springer

favoriteEmaildiscussreport

291views Algorithms» more ANTS 2010»

Fixed Points for Discrete Logarithms

13 years 8 months ago

Fixed Points for Discrete Logarithms

Download www.math.dartmouth.edu

: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the discrete logarithm function to the base r for the cyclic group (Z/pZ)×. Tools include a numerically explicit version of the P´olya–Vinogradov inequality for the sum of values of a Dirichlet character on an interval, some combinatorial sieving techniques, plus an exhaustive search over small cases.

Mariana Levin, Carl Pomerance, K. Soundararajan

Real-time Traffic

Algorithms | ANTS 2010 | Combinatorial Sieving Techniques | Discrete Logarithm Function | Primitive Root |

claim paper

Related Content

» External memory planar point location with logarithmic updates

» On algorithms for discrete and approximate brouwer fixed points

» An Efficient Group Signature Based on the Discrete Logarithm Problem

» Positive circuits and maximal number of fixed points in discrete dynamical systems

» Quantum Logic Implementation of Unary Arithmetic Operations

» On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

» Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

» A PrivacyFriendly Loyalty System Based on Discrete Logarithms over Elliptic Curves

» On the low hamming weight discrete logarithm problem for nonadjacent representations

Post Info
More Details (n/a)

Added	15 Aug 2010
Updated	15 Aug 2010
Type	Conference
Year	2010
Where	ANTS
Authors	Mariana Levin, Carl Pomerance, K. Soundararajan

Comments (0)