2967 search results - page 145 / 594 » Cryptology |
166
click to vote
CTRSA
2003
Springer
16 years 8 days ago
2003
Springer
We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For...
189
click to vote
EUROCRYPT
2010
Springer
15 years 12 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
243
click to vote
CALC
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This talk is a brief survey of recent results and ideas concerning the problem of finding a small root of a univariate polynomial mod N, and the companion problem of fi...
171
click to vote
CALC
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...
159
click to vote
CHES
2001
Springer
15 years 11 months ago
2001
Springer
This paper introduces a new block cipher, and discusses its security. Its design is optimized for high-bandwidth applications that do not have high requirements on key-schedule lat...