31 search results - page 6 / 7 » How to Break MD5 and Other Hash Functions |
FTDCS
2003
IEEE
13 years 11 months ago
2003
IEEE
Various schemes have been proposed to achieve strong authenticationof streamed data in a lossy network by means of “light” digital signatures. Such techniques perform a strong...
PLDI
2012
ACM
11 years 8 months ago
2012
ACM
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combi...
ALGORITHMICA
1998
13 years 5 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
COCO
2006
Springer
13 years 9 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
ACHI
2009
IEEE
14 years 17 days ago
2009
IEEE
– The general context of the work presented in this paper is assistive robotics with our long-term aim to support children with autism. This paper is part of the Aurora project t...