2967 search results - page 241 / 594 » Cryptology |
196
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
187
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
177
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. This paper investigates the design of S-boxes used for combining linear feedback shift register (LFSR) sequences in combination generators. Such combination generators ha...
190
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
174
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...