High speed calculation of cryptographic hash functions by CNN chips

Marton Csapodi, Joos Vandewalle, Tamas Roska

Research output: Contribution to conferencePaper

6 Citations (Scopus)

Abstract

This paper is concerned with the implementation of cryptographic hash functions on the regular array of simple cellular neural network (CNN) cells with periodic boundary conditions. Cryptographic hash functions enable message origin authentication and validation of message content integrity. A class of cryptographic hash functions - termed Cartesian authentication codes - provide provable (unconditional) security for message authentication between two mutually trustful parties sharing a secret key. We succeeded in implementing existing constructions of Cartesian authentication codes on today's CNN Universal Machine (CNN-UM) chips. Here we prove that rather complex (binary) arithmetic can be performed on a simple CNN chip, by providing an algorithm to implement a specific Cartesian authentication code based on the computation of a polynomial expression over a finite field. The bitrate of the computation is in the 100 Mbit/sec range with existing chips.

Original languageEnglish
Pages186-191
Number of pages6
Publication statusPublished - Jan 1 1998
EventProceedings of the 1998 5th IEEE International Workshop on Cellular Neural Networks and Their Applications, CNNA - London, UK
Duration: Apr 14 1998Apr 17 1998

Other

OtherProceedings of the 1998 5th IEEE International Workshop on Cellular Neural Networks and Their Applications, CNNA
CityLondon, UK
Period4/14/984/17/98

    Fingerprint

ASJC Scopus subject areas

  • Software

Cite this

Csapodi, M., Vandewalle, J., & Roska, T. (1998). High speed calculation of cryptographic hash functions by CNN chips. 186-191. Paper presented at Proceedings of the 1998 5th IEEE International Workshop on Cellular Neural Networks and Their Applications, CNNA, London, UK, .