Sciweavers

1560 search results - page 33 / 312
» Order Functions and Evaluation Codes
Sort
View
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
14 years 9 days ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
WCET
2007
13 years 10 months ago
Analysis of path exclusion at the machine code level
We present a method to find static path exclusions in a control flow graph in order to refine the WCET analysis. Using this information, some infeasible paths can be discarded ...
Ingmar Stein, Florian Martin
TCOM
2008
105views more  TCOM 2008»
13 years 8 months ago
Source fidelity over fading channels: performance of erasure and scalable codes
We consider the transmission of a Gaussian source through a block fading channel. Assuming each block is decoded independently, the received distortion depends on the tradeoff betw...
Konstantinos E. Zachariadis, Michael L. Honig, Agg...
ACSAC
2009
IEEE
14 years 3 months ago
FPValidator: Validating Type Equivalence of Function Pointers on the Fly
—Validating function pointers dynamically is very useful for intrusion detection since many runtime attacks exploit function pointer vulnerabilities. Most current solutions tackl...
Hua Wang, Yao Guo, Xiangqun Chen
DATE
2002
IEEE
89views Hardware» more  DATE 2002»
14 years 1 months ago
Generalized Early Evaluation in Self-Timed Circuits
Phased logic has been proposed as a technique for realizing self-timed circuitry that is delay-insensitive and requires no global clock signals. Early evaluation techniques have b...
Mitchell A. Thornton, Kenneth Fazel, Robert B. Ree...