2967 search results - page 318 / 594 » Cryptology |
152
click to vote
CHES
2001
Springer
15 years 11 months ago
2001
Springer
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
178
Voted
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
152
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
An (n, m, k)-resilient function is a function f : Fn 2 → Fm 2 such that every possible output m-tuple is equally likely to occur when the values of k arbitrary inputs are fixed ...
178
Voted
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The shrinking generator is a well-known keystream generator composed of two linear feedback shift registers, LFSR1 and LFSR2, where LFSR1 is clock-controlled according to...
182
click to vote
CTRSA
2001
Springer
15 years 11 months ago
2001
Springer
We consider the usage of forward security with threshold signature schemes. This means that even if more than the threshold number of players are compromised, some security remain...