Sciweavers

39 search results - page 2 / 8
» Evasiveness and the Distribution of Prime Numbers
Sort
View
CHES
2006
Springer
133views Cryptology» more  CHES 2006»
13 years 9 months ago
Fast Generation of Prime Numbers on Portable Devices: An Update
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despit...
Marc Joye, Pascal Paillier
IPPS
2006
IEEE
13 years 11 months ago
Honeybees: combining replication and evasion for mitigating base-station jamming in sensor networks
By violating MAC-layer protocols, the jamming attack aims at blocking successful communication among wireless nodes. Wireless sensor networks (WSNs) are highly vulnerable to jammi...
Sherif M. Khattab, Daniel Mossé, Rami G. Me...
ANTS
2006
Springer
94views Algorithms» more  ANTS 2006»
13 years 9 months ago
Fast Bounds on the Distribution of Smooth Numbers
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
Scott T. Parsell, Jonathan Sorenson
ISPDC
2005
IEEE
13 years 10 months ago
A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
Gabriel Paillard, Christian Antoine Louis Lavault,...
CORR
2008
Springer
94views Education» more  CORR 2008»
13 years 5 months ago
On the Weight Distribution of the Extended Quadratic Residue Code of Prime 137
The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-eve...
Cen Tjhai, Martin Tomlinson, Marcel Ambroze, Moham...