Sciweavers

3328 search results - page 155 / 666
» On Plateaued Functions and Their Constructions
Sort
View
DATE
1999
IEEE
101views Hardware» more  DATE 1999»
15 years 10 months ago
Polynomial Methods for Allocating Complex Components
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
James Smith, Giovanni De Micheli
CRYPTO
1995
Springer
140views Cryptology» more  CRYPTO 1995»
15 years 10 months ago
Bucket Hashing and its Application to Fast Message Authentication
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small numb...
Phillip Rogaway
ENTCS
2007
104views more  ENTCS 2007»
15 years 6 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
JOLLI
1998
86views more  JOLLI 1998»
15 years 6 months ago
On the Logic of Theory Change: Contraction without Recovery
The postulate of Recovery, among the six postulates for theory contraction, formulated and studied by Alchourr´on, G¨ardenfors and Makinson is the one that has provoked most cont...
Eduardo L. Fermé
TCC
2010
Springer
175views Cryptology» more  TCC 2010»
15 years 4 months ago
Obfuscation of Hyperplane Membership
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...
Ran Canetti, Guy N. Rothblum, Mayank Varia