Sciweavers

5 search results - page 1 / 1
» Irregularity of Prime Numbers over Real Quadratic Fields
Sort
View
MOC
2002
132views more  MOC 2002»
13 years 4 months ago
Comparison of algorithms to calculate quadratic irregularity of prime numbers
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...
Joshua Holden
JOC
2006
77views more  JOC 2006»
13 years 4 months ago
An Improved Real-Quadratic-Field-Based Key Exchange Procedure
To date, the only non-group structure that has been suitably employed as the key space for Diffie-Hellman type cryptographic key exchange is the infrastructure of a real quadratic ...
Michael J. Jacobson Jr., Renate Scheidler, Hugh C....
MOC
1998
102views more  MOC 1998»
13 years 4 months ago
Classification of integral lattices with large class number
A detailed exposition of Kneser’s neighbour method for quadratic lattices over totally real number fields, and of the sub-procedures needed for its implementation, is given. Usi...
Rudolf Scharlau, Boris Hemkemeier
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
13 years 8 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama