5 search results - page 1 / 1 » Variant code transformations for linear quadtrees |
PRL
2002
13 years 4 months ago
2002
In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm ha...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
In a series of papers Patarin proposes new efficient public key systems. A very interesting proposal, called 2-Round Public Key System with S Boxes, or 2R, is based on the difficul...
INDOCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a family of cryptographic hash functions. The security claim of the FSB hashes is based on a coding theory pro...
CP
2008
Springer
13 years 6 months ago
2008
Springer
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both wi...
ANOR
2010
13 years 2 months ago
2010
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...