2967 search results - page 406 / 594 » Cryptology |
143
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we s...
170
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
160
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
160
click to vote
FSE
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. A simple one-way function along with its proposed application in symmetric cryptography is described. The function is computable with three elementary operations on permu...
161
click to vote
FSE
2004
Springer
15 years 11 months ago
2004
Springer
Recent research shows that the class of Rotation Symmetric Boolean Functions (RSBFs), i.e., the class of Boolean functions that are invariant under circular translation of indices,...