scientific article; zbMATH DE number 962546

MaRDI QIDQ5690810zbMATH OpenFDO

Authors Vijay Shekar Jha

Publication date 12 February 1997

zbMATH Keywords

Bernoulli numberscomplexitycyclotomic fieldsdiscrete Fourier transformirregular pairs

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Cyclotomic extensions (11R18) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Recommendations

• Faster computation of isogenies of large prime degree
• Speeding Up the Pollard Rho Method on Prime Fields
• scientific article; zbMATH DE number 4215363
• Comparison of algorithms to calculate quadratic irregularity of prime numbers
• New fast methods to compute the number of primes smaller than a given value
• Faster computation of the Tate pairing
• Fast compact prime number sieves (among others)
• A faster pseudo-primality test
• Algorithms for pairing-friendly primes
• An improved algorithm to compute the -primality

Cited in

(5)

• Comparison of algorithms to calculate quadratic irregularity of prime numbers
• Distribution of irregular pairs
• Irregular Primes to One Million
• Irregular primes to two billion
• Irregular primes and cyclotomic invariants to 12 million

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690810)