3984 search results - page 512 / 797 » A Model-Driven Transformation Method |
174
click to vote
FM
2003
Springer
15 years 11 months ago
2003
Springer
We present the formal framework for a novel approach for specifying and automatically implementing systems such as digital circuits and network protocols. The goal is to reduce the...
139
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
151
click to vote
INDOCRYPT
2003
Springer
15 years 11 months ago
2003
Springer
We consider a variant of the Complex Multiplication (CM) method for constructing elliptic curves (ECs) of prime order with additional security properties. Our variant uses Weber po...
156
click to vote
ISCAS
2002
IEEE
15 years 11 months ago
2002
IEEE
We address the problem of checking the routability of segmented channels using satisfiability. The segmented channel routing problem arises in the context of row-based field progr...
166
click to vote
FSE
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we improve the recent rebound and start-from-the-middle attacks on AES-like permutations. Our new cryptanalysis technique uses the fact that one can view two rounds ...