16 search results - page 1 / 4 » An Improvement to the Gaudry-Schost Algorithm for Multidimen... |
IMA
2009
Springer
13 years 11 months ago
2009
Springer
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to ...
MOC
2002
13 years 4 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
CCS
2008
ACM
13 years 6 months ago
2008
ACM
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...