9 search results - page 2 / 2 » Bit Security of the CDH Problems over Finite Fields |
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
We introduce a practical synchronous stream cipher with provable security named QUAD. The cipher relies on the iteration of a multivariate quadratic system of m equations in n <...
CRYPTO
1998
Springer
15 years 4 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 ...
TIT
2008
14 years 11 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
126
click to vote
BMCBI
2008
14 years 12 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...