Sciweavers

397 search results - page 43 / 80
» Pseudorandom Functions and Lattices
Sort
View
IFIP
2001
Springer
15 years 5 months ago
Functional Test Generation using Constraint Logic Programming
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
Zhihong Zeng, Maciej J. Ciesielski, Bruno Rouzeyre
ASIACRYPT
2009
Springer
15 years 7 months ago
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions
Abstract. Physical attacks on cryptographic implementations and devices have become crucial. In this context a recent line of research on a new class of side-channel attacks, calle...
Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi,...
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
15 years 2 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
DCC
1999
IEEE
15 years 5 months ago
Performance of Quantizers on Noisy Channels Using Structured Families of Codes
Abstract--Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for ...
András Méhes, Kenneth Zeger
MICS
2010
107views more  MICS 2010»
14 years 11 months ago
The Newton Polygon of a Rational Plane Curve
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoret...
Carlos D'Andrea, Martín Sombra