12 search results - page 1 / 3 » Special prime numbers and discrete logs in finite prime fiel... |
MOC
2002
13 years 4 months ago
2002
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...
CRYPTO
1998
Springer
13 years 9 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...