15 search results - page 3 / 3 » The Pseudosquares Prime Sieve |
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
1 This paper presents a methodology to develop more modular parallel applications, based on aspect oriented programming. Traditional object oriented mechanisms implement applicatio...
ANTS
2010
Springer
13 years 9 months ago
2010
Springer
: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the d...
CIE
2008
Springer
13 years 7 months ago
2008
Springer
The first extensive number-theoretical computation run on the world's first U.S. digital general-purpose electronic computer, the ENIAC, is reconstructed. The problem, computi...
PKC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...