561 search results - page 10 / 113 » Using number fields to compute logarithms in finite fields |
CAP
2010
13 years 3 months ago
2010
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
WSC
2008
13 years 10 months ago
2008
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
CRYPTO
1998
Springer
14 years 20 days 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 ...
ASAP
2004
IEEE
14 years 5 days ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
ANTS
1998
Springer
14 years 20 days ago
1998
Springer
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...