Gesellschaft für Informatik e.V.

Lecture Notes in Informatics

ARCS 2004 - Organic and Pervasive Computing, Workshops Proceedings, March 26, 2004, Augsburg, Germany. P-41, 318-327 (2004).

GI, Gesellschaft für Informatik, Bonn


Uwe Brinkschulte (ed.), Jürgen Becker (ed.), Dietmar Fey (ed.), Karl-Erwin Großpietsch (ed.), Christian Hochberger (ed.), Erik Maehle (ed.), Thomas A. Runkler (ed.)

Copyright © GI, Gesellschaft für Informatik, Bonn


Modelling cryptonite on the design of a programmable high-performance crypto processor

Rainer Buchty


Cryptographic algorithms - even when designed for easy implementability on general purpose architectures - still show a huge performance gap between implementations in software and those using dedicated hardware. Such hardware is usually only able to deal with one single algorithm or a very narrowly defined set of algorithms. The tradeoff between speed/throughput and flexibility can be eased by programmable crypto architectures. These can be existing general purpose architectures enhanced by specialized functional units which fulfill the requirements of typical cryptographic algorithms. Alternatively, a fully custom architecture can be designed. In this paper we describe the methods used to design a programmable crypto architecture from scratch. We will introduce a set of typical cryptographic algorithms, investigate their requirements, and finally show the weighted result leading to our Cryptonite architecture.

Full Text: PDF

GI, Gesellschaft für Informatik, Bonn
ISBN 3-88579-370-9

Last changed 04.10.2013 18:00:33