Sciweavers

1296 search results - page 14 / 260
» The Number Field Sieve
Sort
View
FFA
2010
159views more  FFA 2010»
13 years 7 months ago
Parity of the number of irreducible factors for composite polynomials
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...
Ryul Kim, Wolfram Koepf
MOC
2002
132views more  MOC 2002»
13 years 9 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
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
13 years 9 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof
MOC
2000
132views more  MOC 2000»
13 years 9 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
IPPS
2006
IEEE
14 years 3 months ago
Incrementally developing parallel applications with AspectJ
1 This paper presents a methodology to develop more modular parallel applications, based on aspect oriented programming. Traditional object oriented mechanisms implement applicatio...
João Luís Sobral