St. Peter erhält Auszeichnung für die beste Dipl.-Arbeit der
       Fak. 1 der BTU Cottbus; die Verleihung findet am 03.07.2007
       statt

In the diploma thesis Steffen Peter discusses approaches that allow to construct efficient hardware accelerators for Elliptic Curve Cryptography. First improved polynomial multiplication units are evaluated. Such multipliers are the most important components of ECC hardware accelerators. The proposed hRAIK multiplication improves energy consumption, the longest path, and required silicon area compared to state of the art approaches.

Based on the results the thesis discusses two ways to provide flexible hardware support for the reduction step in Elliptic Curve Cryptography in binary fields (GF(2^m)). The first approach uses several dedicated reduction units within a single multiplier. The measurement results show that this simple approach leads to an additional area consumption of less than 10% compared to a dedicated design without performance penalties. The second approach supports any elliptic curve cryptography up to a predefined maximal length. It take advantage of the features of commonly used reduction polynomials. The results show a significant area penalty compared to dedicated designs. However, we achieve flexibility and the performance is still significantly better than those of known ECC hardware accelerator approaches with similar flexibility or even software implementations.

Based on the results of the theses two patents have been filed and three papers were published.