Sciweavers

2214 search results - page 79 / 443
» complexity 2004
Sort
View
FSE
2005
Springer
84views Cryptology» more  FSE 2005»
14 years 1 months ago
Some Attacks on the Bit-Search Generator
The bit-search generator (BSG) was proposed in 2004 and can be seen as a variant of the shrinking and self-shrinking generators. It has the advantage that it works at rate 1/3 usin...
Martin Hell, Thomas Johansson
PKC
2004
Springer
150views Cryptology» more  PKC 2004»
14 years 1 months ago
Undeniable Signatures Based on Characters: How to Sign with One Bit
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
Jean Monnerat, Serge Vaudenay
RE
2004
Springer
14 years 1 months ago
Requirements for Requirements Management Tools
Tools for managing systems requirements help keeping specifications consistent, up-to-date and accessible. Since the requirements for complex systems are themselves complex inform...
Matthias Hoffmann, Nikolaus Kühn, Matthias We...
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 9 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
ECIS
2000
13 years 9 months ago
What's in a Name? Conceptual Issues in Defining Electronic Commerce
Definitions of electronic commerce are many and varied. They indicate a lack of consensus about what electronic commerce is. `A `definition' implies a direct and unproblematic...
Linda Wilkins, Paula M. C. Swatman, Tanya Castlema...