Sciweavers

1629 search results - page 206 / 326
» Infeasible Code Detection
Sort
View
ITCC
2005
IEEE
15 years 7 months ago
ASIC Implementation of a Unified Hardware Architecture for Non-Key Based Cryptographic Hash Primitives
Hash algorithms are a class of cryptographic primitives used for fulfilling the requirements of integrity and authentication in cryptography. In this paper, we propose and present...
T. S. Ganesh, T. S. B. Sudarshan
IAW
2003
IEEE
15 years 6 months ago
Static Verification of Worm and virus Behavior in binary Executables using Model Checking
- Use offormal methods in any application scenario requires a precise characterization and representation of the properties that need to be verified The target, which is desired ri...
Prabhat K. Singh, Arun Lakhotia
ICDCS
2003
IEEE
15 years 6 months ago
Monotonicity and Partial Results Protection for Mobile Agents
Remotely executing mobile code introduces a plethora of security problems. This paper examines the “external agent replay” attack, identifies the notion of one-way program st...
Bennet S. Yee
SACRYPT
1998
Springer
129views Cryptology» more  SACRYPT 1998»
15 years 5 months ago
An Accurate Evaluation of Maurer's Universal Test
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (...
Jean-Sébastien Coron, David Naccache
PLILP
1994
Springer
15 years 5 months ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte