144 search results - page 23 / 29 » Fusion Discrete Logarithm Problems |
EUROCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
ICISC
2004
13 years 10 months ago
2004
An identity (ID)-based signature scheme allows any pair of users to verify each other's signatures without exchanging public key certificates. With the advent of Bilinear maps...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
CPM
2009
Springer
14 years 3 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...