434 search results - page 28 / 87 » Logical Analysis of Hash Functions |
157
click to vote
EUC
2007
Springer
15 years 9 months ago
2007
Springer
Traditional cryptographic primitives are not supported on low-cost RFID tags since, at most, 4K gates can be devoted to securityrelated tasks. Despite this, there are a vast number...
216
click to vote
SIGCOMM
2012
ACM
13 years 8 months ago
2012
ACM
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary wit...
180
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
147
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
155
click to vote
DAC
2006
ACM
16 years 6 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...