Sciweavers

39 search results - page 4 / 8
» A note on the distribution of the number of prime factors of...
Sort
View
MOC
1998
98views more  MOC 1998»
13 years 7 months ago
Distribution of irreducible polynomials of small degrees over finite fields
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we ...
Kie H. Ham, Gary L. Mullen
APPT
2009
Springer
13 years 11 months ago
Efficient Multiplication of Polynomials on Graphics Hardware
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...
Pavel Emeliyanenko
IJNSEC
2008
96views more  IJNSEC 2008»
13 years 7 months ago
Eliminating Quadratic Slowdown in Two-Prime RSA Function Sharing
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
Maged Hamada Ibrahim
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 7 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
DM
2008
113views more  DM 2008»
13 years 7 months ago
Multivariate Fuss-Catalan numbers
Catalan numbers C(n) = 1 n+1 2n n enumerate binary trees and Dyck paths. The distribution of paths with respect to their number k of factors is given by ballot numbers B(n, k) = n-...
Jean-Christophe Aval