Bernd Schnitzer

Learn More
Scientiic databases must be able to eeciently run subset retrievals of multi-dimensional data sets. If the data sets are very large signiicant retrieval speedups can be obtained via parallelism. In this paper we present a new parallel distributed shared nothing Rtree architecture. To the best of our knowledge this is the rst signiicant experimental study(More)
This paper describes an efficient implementation of a crypto arithmetic unit, which computes the modular-operations addition, multiplication, and inversion in prime fields. These calculations are important for an application in elliptic curve cryptography (ECC). The hardware is designed in a self-timed and low-power approach. The paper discusses the pros(More)
  • 1