561 search results - page 12 / 113 » Using number fields to compute logarithms in finite fields |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
While several image-based rendering techniques have been proposed to successfully render scenes/objects from a large collection (e.g., thousands) of images without explicitly reco...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
In [8], the authors proposed the large deformation logunbiased diffeomorphic nonlinear image registration model which has been successfully used to obtain theoretically and intuit...
ANTS
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
CHES
2007
Springer
14 years 2 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...