Abstract. This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toepli...
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...
Ryuichi Harasawa, Junji Shikata, Joe Suzuki, Hidek...
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
Abstract. In this paper, we give some relationship between the nonlinearity of rational functions over F2n and the number of points of associated hyperelliptic curve. Using this, w...