116 views143 votes14 years 10 months ago MOC 2010»
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
76 views126 votes15 years 3 months ago AAECC 2004»
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
142 views135 votes15 years 10 months ago BTW 2007»
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
A detailed exposition of Kneser’s neighbour method for quadratic lattices over totally real number fields, and of the sub-procedures needed for its implementation, is given. Usi...
110 views119 votes15 years 5 months ago IJCAI 2001»
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
Abstract. A corrector is used to reduce or eliminate statistical weakness of a physical random number generator. A description of linear corrector generalizing post-processing desc...
114 views138 votes15 years 9 months ago ACSAC 2003»
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...
227 views151 votes15 years 5 months ago DDECS 2008»
The paper introduces a cryptographic System on a Chip (SoC) implementation based on recent Actel nonvolatile FPGA Fusion chip with embedded ARM7 soft-core processor. The SoC is bui...
109 views183 votes16 years 4 months ago VLDB 2007»
An increasing number of temporally versioned text collections is available today with Web archives being a prime example. Search on such collections, however, is often not satisfa...