4255 search results - page 213 / 851 » On Learning Boolean Functions |
165
click to vote
FSE
2006
Springer
15 years 10 months ago
2006
Springer
This is the first article analyzing the security of SHA-256 against fast collision search which considers the recent attacks by Wang et al. We show the limits of applying technique...
214
click to vote
APAQS
2001
IEEE
15 years 10 months ago
2001
IEEE
Code-patterns are statically recurring structure specific to a programming language. It can be parallel to aid in designing software systems for solving particular problems. Contr...
156
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. Th...
157
click to vote
RELMICS
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
184
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...