Sciweavers

358 search results - page 19 / 72
» GCD of Many Integers
Sort
View
IMA
2009
Springer
124views Cryptology» more  IMA 2009»
14 years 2 months ago
Comparing with RSA
A multi-set (ms) is a set where an element can occur more than once. ms hash functions (mshfs) map mss of arbitrary cardinality to fixed-length strings. This paper introduces a ne...
Julien Cathalo, David Naccache, Jean-Jacques Quisq...
CEC
2008
IEEE
14 years 1 months ago
EA-MP: An evolutionary algorithm for a mine planning problem
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...
María-Cristina Riff, Teddy Alfaro, Xavier B...
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 1 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
ICALP
2007
Springer
14 years 1 months ago
Constant-Round Private Database Queries
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
Nenad Dedic, Payman Mohassel
INDOCRYPT
2005
Springer
14 years 1 months ago
Cryptanalysis of the Quadratic Generator
Let p be a prime and let a and c be integers modulo p. The quadratic congruential generator (QCG) is a sequence (vn) of pseudorandom numbers defined by the relation vn+1 ≡ av2 n...
Domingo Gómez, Jaime Gutierrez, Álva...