237 search results - page 37 / 48 » MapReduce for Integer Factorization |
88
Voted
EUROCRYPT
2006
Springer
15 years 4 months ago
2006
Springer
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
101
click to vote
ALGOSENSORS
2008
Springer
15 years 2 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
93
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
108
click to vote
CRYPTO
2008
Springer
15 years 2 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
130
Voted
FPL
2008
Springer
15 years 2 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...