Monte Carlo Methods for Index Computation ( mod p )

@inproceedings{Pollard2010MonteCM,
  title={Monte Carlo Methods for Index Computation ( mod p )},
  author={John M. Pollard},
  year={2010}
}
We describe some novel methods to compute the index of any integer relative to a given primitive root of a prime p. Our first method avoids the use of stored tables and apparently requires 0(p ) operations. Our second algorithm, which may be regarded as a method of catching kangaroos, is applicable when the index is known to lie in a certain interval; it requires 0(w ) operations for an interval of width w, but does not have complete certainty of success. It has several possible areas of… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 945 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 350 extracted citations

Emerging Security Mechanisms for Medical Cyber Physical Systems

IEEE/ACM Transactions on Computational Biology and Bioinformatics • 2016
View 7 Excerpts
Highly Influenced

Computing prime divisors in an interval

Math. Comput. • 2015
View 4 Excerpts
Highly Influenced

Fast and secure key agreement protocol for the security of low power wireless networks

2013 IEEE Faible Tension Faible Consommation • 2013
View 4 Excerpts
Highly Influenced

Improved algorithm for the isogeny problem for ordinary elliptic curves

Applicable Algebra in Engineering, Communication and Computing • 2013
View 11 Excerpts
Method Support
Highly Influenced

An Efficient Method to Factorize the RSA Public Key Encryption

2011 International Conference on Communication Systems and Network Technologies • 2011
View 8 Excerpts
Method Support
Highly Influenced

ECDLP on GPU

IACR Cryptology ePrint Archive • 2011
View 4 Excerpts
Highly Influenced

Time Estimation of Cheon's Algorithm over Elliptic Curves on Finite Fields with Characteristic 3

2011 Fifth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing • 2011
View 13 Excerpts
Highly Influenced

945 Citations

050100'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 945 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

A Monte Carlo method for factorization," BIT, v

J. M. POLLARD
15, • 1975
View 5 Excerpts
Highly Influenced

GUY, "How to factor a number,

R K.
Proc. Fifth Manitoba Conf. on Numerical Math. (Winnipeg, Man., • 1975
View 7 Excerpts
Highly Influenced

M

W. DIFFI
E. HELLMAN, "New directions in cryptography," IEEE Trans. Information Theory, vol. IT-22, No. 6, Nov. • 1976
View 1 Excerpt

Aliquot Sequences, M

J. S. DEVITT
Sc. Thesis, Dept. of Math, and Stat., Univ. of Calgary, May • 1976
View 1 Excerpt

JOHN BRILLHART, "A method of factoring and the factorization of F7," Math

MICHAEL A. MORRISO
Comp., v. 29, • 1975
View 1 Excerpt

" On factorization , with a suggested new approach

A. MICHAEL
1975

MORRISON & JOHN BRILLHART , " A method of factoring and the factorization of F 7

A. MICHAEL
1975

On factorization, with a suggested new approach," Math

J.C.P. MILLER
Comp., v. 29, • 1975
View 1 Excerpt

EMMA LEHMER, "A new factorization technique using quadratic forms," Math

D. H. LEHME
Comp., v. 28, • 1974
View 1 Excerpt

Theorems on factorization and primality testing," Proc Cambridge Philos

J. M. POLLARD
Soc, V. 76, • 1974
View 1 Excerpt