Comparison of algorithms to calculate quadratic irregularity of prime numbers (Q2781231)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparison of algorithms to calculate quadratic irregularity of prime numbers |
scientific article; zbMATH DE number 1720980
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of algorithms to calculate quadratic irregularity of prime numbers |
scientific article; zbMATH DE number 1720980 |
Statements
19 March 2002
0 references
Bernoulli numbers
0 references
Bernoulli polynomials
0 references
irregular primes
0 references
zeta functions
0 references
quadratic extensions
0 references
cyclotomic extensions
0 references
class groups
0 references
cryptography
0 references
0.86796194
0 references
0.8462396
0 references
0.84542173
0 references
0.8420788
0 references
0.83971465
0 references
0 references
Comparison of algorithms to calculate quadratic irregularity of prime numbers (English)
0 references
