Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IJNSEC
2006
107views more  IJNSEC 2006»
11 years 8 months ago
ID-based Signcryption Scheme with (t, n) Shared Unsigncryption
An identity-based signcryption scheme with (t, n) shared unsigncryption is proposed, which is the integration of the signcryption scheme, the (t, n) threshold scheme and zero know...
Fagen Li, Xiangjun Xin, Yupu Hu
CATS
2008
11 years 9 months ago
On the Efficiency of Pollard's Rho Method for Discrete Logarithms
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
Shi Bai, Richard P. Brent
EUROCRYPT
2000
Springer
11 years 11 months ago
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...
Pierrick Gaudry
EUROCRYPT
2006
Springer
11 years 12 months ago
The Function Field Sieve in the Medium Prime Case
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...
Antoine Joux, Reynald Lercier
CRYPTO
1992
Springer
154views Cryptology» more  CRYPTO 1992»
12 years 7 days ago
Massively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
Daniel M. Gordon, Kevin S. McCurley
CRYPTO
1993
Springer
118views Cryptology» more  CRYPTO 1993»
12 years 8 days ago
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
Abstract. There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponen...
Leonard M. Adleman, Jonathan DeMarrais
ASIACRYPT
2000
Springer
12 years 15 days ago
Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
Abstract. In this work we investigate the difficulty of the discrete logarithm problem in class groups of imaginary quadratic orders. In particular, we discuss several strategies t...
Safuat Hamdy, Bodo Möller
books