1769 search results - page 109 / 354 » Cryptography |
106
click to vote
IMA
2009
Springer
15 years 10 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 ...
119
click to vote
IMA
2009
Springer
15 years 10 months ago
2009
Springer
The Rayleigh quotient of a bent function is an invariant under the action of the orthogonal group, and it measures the distance of the function to its dual. An efficient algorithm ...
108
click to vote
IMA
2009
Springer
15 years 10 months ago
2009
Springer
Let f : F n 2 → F n 2 be an almost perfect nonlinear function (APN). The set Df := {(a, b) : f(x + a) − f(x) = b has two solutions} can be used to distinguish APN functions up ...
119
click to vote
PAIRING
2009
Springer
15 years 10 months ago
2009
Springer
This paper presents efficient formulas for computing cryptographic pairings on the curve y2 = cx3 + 1 over fields of large characteristic. We provide examples of pairing-friendly...
131
click to vote
ACNS
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. In order to increase the security for authenticated key exchange protocols, various authentication means can be used together. In this paper, we introduce a security mode...