Markus Ullrich

Learn More
In this paper, we will present an approach to find efficient bitsliced implementations of invertible 4 × 4-bit s-boxes. The approach generalises the methods introduced by Osvik [12]. We consider equivalence classes of s-boxes under linear and affine equivalence and search for the most efficient s-box in each class. The properties of these s-boxes are(More)
—When mapping public-key algorithms, such as RSA, onto constrained devices, both efficiency and flexibility are a challenge. Because word lengths are large, minimum 1024 bits, typically a dedicated co-processor is used. On the other hand, flexibility is required, because designers want to support a variety of RSA exponentiation algorithms. Typically the(More)
  • 1