15 search results - page 2 / 3 » The Pseudosquares Prime Sieve |
MOC
2010
13 years 4 days ago
2010
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
CRYPTO
1992
Springer
13 years 9 months ago
1992
Springer
Using a number field sieve, discrete logarithms modulo primes of special forms can be found faster than standard primes. This has raised concerns about trapdoors in discrete log cr...
FPGA
2000
ACM
13 years 9 months ago
2000
ACM
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer