2316 search results - page 134 / 464 » The many forms of hypercomputation |
132
click to vote
ASIACRYPT
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
152
click to vote
EMMCVPR
1999
Springer
15 years 9 months ago
1999
Springer
Markov Random Fields are widely used in many image processing applications. Recently the shortcomings of some of the simpler forms of these models have become apparent, and models ...
114
click to vote
RSP
1999
IEEE
15 years 9 months ago
1999
IEEE
Formal methods are a nice idea, but the size and complexity of real systems means that they are impractical. We propose that a reasonable alternative to attempting to specify and ...
114
click to vote
FSE
1999
Springer
15 years 9 months ago
1999
Springer
We introduce “mod n cryptanalysis,” a form of partitioning attack that is effective against ciphers which rely on modular addition and bit rotations for their security. We dem...
131
click to vote
VL
1999
IEEE
15 years 9 months ago
1999
IEEE
Sonnet was designed as a visual language for implementing real-time processes. Early design and development of behavioral components has largely focused on the domain of music pro...