Comparison of algorithms to calculate quadratic irregularity of prime numbers

DOI10.1090/S0025-5718-01-01341-2zbMath1066.11057arXivmath/0010286OpenAlexW2008903262MaRDI QIDQ2781231

Joshua Brandon Holden

Publication date: 19 March 2002

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0010286

zbMATH Keywords

cryptographyclass groupsBernoulli numberscyclotomic extensionszeta functionsBernoulli polynomialsquadratic extensionsirregular primes

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Class numbers, class groups, discriminants (11R29) Zeta functions and (L)-functions of number fields (11R42) Cyclotomic extensions (11R18) Evaluation of number-theoretic constants (11Y60)

Related Items (1)

First-hit analysis of algorithms for computing quadratic irregularity

Uses Software

• PARI/GP

Cites Work

• On the values at negative integers of the zeta-function of a real quadratic field
• On the Fontaine-Mazur conjecture for number fields and an analogue for function fields
• Variations sur un thème de Siegel et Hecke
• First-hit analysis of algorithms for computing quadratic irregularity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparison of algorithms to calculate quadratic irregularity of prime numbers