On Random Pattern Testability of Cryptographic VLSI Cores

  • Authors:
  • A. Schubert;W. Anheier

  • Affiliations:
  • Institut für Theoretische Elektrotechnik und Mikroelektronik (ITEM), University of Bremen, P.O. Box 330440, D-28334 Bremen, Germany. schubert@item.uni-bremen.de;Institut für Theoretische Elektrotechnik und Mikroelektronik (ITEM), University of Bremen, P.O. Box 330440, D-28334 Bremen, Germany. anheier@item.uni-bremen.de

  • Venue:
  • Journal of Electronic Testing: Theory and Applications - special issue on the European test workshop 1999
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we show, that the statisticalproperties of cryptographic algorithms are the reason for theexcellent pseudorandom testability of cryptographic processor cores.The work is especially concerned with modern symmetric blockencryption algorithms and their VLSI implementations. For theexamination typical basic operations of these cryptographicalgorithms are categorized in classes and analyzed regarding theirpseudorandom properties. Based on the results the pseudorandomproperties of symmetric block ciphers can be determined by means ofdata flow graphs (DFG) and so-called predecessor operation lists.This is demonstrated with a paradigm algorithm, the symmetric blockcipher 3WAY. The results of the theoretical analysis lead to aso-called global BIST concept for cryptographic processor cores. Thisself-test approach is characterized by central pseudorandom patterngenerators and signature registers at the primary inputs and outputsof the cores. The global BIST is exemplarily applied to animplementation of the 3WAY algorithm. Finally, the quality of thedeveloped test approach is determined by fault simulations.