First-hit analysis of algorithms for computing quadratic irregularity
From MaRDI portal
Publication:4452171
DOI10.1090/S0025-5718-03-01593-XzbMath1115.11070arXivmath/0011054OpenAlexW2080821937MaRDI QIDQ4452171
Publication date: 12 February 2004
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0011054
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)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in Cryptology -- CRYPTO '97. 17th annual international cryptology conference. Santa Barbara, CA, USA. August 17--21, 1997. Proceedings
- The complexity of number-theoretic constants
- A signature scheme based on the intractability of computing roots
- On the Fontaine-Mazur conjecture for number fields and an analogue for function fields
- Comparison of algorithms to calculate quadratic irregularity of prime numbers
- Faster computation of Bernoulli numbers
- Irregular Primes to One Million
- Irregular Primes and Cyclotomic Invariants
- The Irregular Primes to 125000
This page was built for publication: First-hit analysis of algorithms for computing quadratic irregularity