Sciweavers

2107 search results - page 95 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
FSE
2011
Springer
264views Cryptology» more  FSE 2011»
14 years 6 months ago
An Improved Algebraic Attack on Hamsi-256
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
Itai Dinur, Adi Shamir
131
Voted
ACSC
2009
IEEE
15 years 10 months ago
The Impact of Quanta on the Performance of Multi-level Time Sharing Policy under Heavy-tailed Workloads
Recent research indicates that modern computer workloads (e.g. processing time of web requests) follow heavy-tailed distributions. In a heavy-tailed distribution there are a large...
Malith Jayasinghe, Zahir Tari, Panlop Zeephongseku...
ITCC
2005
IEEE
15 years 9 months ago
The N/R One Time Password System
A new one time password system is described which is secure against eavesdropping and server database compromise at the same time. Traditionally, these properties have proven to b...
Vipul Goyal, Ajith Abraham, Sugata Sanyal, Sang-Yo...
135
Voted
APWEB
2010
Springer
15 years 6 months ago
Computing Large Skylines over Few Dimensions: The Curse of Anti-correlation
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
Henning Köhler, Jing Yang
FOCS
1992
IEEE
15 years 7 months ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo