References: [ Home | Author index | Key index | Search ]

All items with author Mihailescu (sorted by date)

Mihailescu88

P. Mihailescu, A primality test using cyclotomic functions.  In "AAECC-6," T. Mora editor, Lecture Notes in Computer Science Vol, 357, Springer-Verlag, 1988.  pp. 310-323,

Mihailescu94

P. Mihailescu,"Fast generation of provable primes using search in arithmetic progressions" in Advances in cryptology-asiacrypt '94.  Lecture Notes in Computer Science Vol, 839, Springer-Verlag, 1994.  New York, NY, pp. 282--293, MR 95j:11122

Mihailescu97

P. Mihailescu, "Cyclotomy of rings and primality testing," Ph.D. thesis, ETH Zurich, (1997) Dissertation 12279.

Mihailescu98

P. Mihailescu, Cyclotomy primality proving -- recent developments.  In "Proceedings of the III Applied Number Theory Seminar, ANTS III, Portland, Oregon 1998," Lecture Notes in Computer Science Vol, 1423, 1998.  pp. 95--110, MR 2000j:11195

MN99

P. Mihailescu and C. Nash, "Binary tree evaluation method for Lucas-Lehmer primality tests," (1999) preprint.

Mihailescu2003

P. Mihailescu, "A class number free criterion for Catalan's conjecture," J. Number Theory, 99:2 (2003) 225--231.  MR 1 968 450