Cryptology ePrint Archive: Report 2004/216
Tree Parity Machine Rekeying Architectures
Markus Volkmer and Sebastian Wallner
Abstract: The necessity to secure the communication between hardware components in embedded systems becomes increasingly important with regard to the secrecy of data and particularly its commercial use. We suggest a low-cost (i.e. small logic-area) solution for flexible security levels and short key lifetimes. The basis is an approach for symmetric key exchange using the synchronisation of Tree Parity Machines. Fast successive key generation enables a key exchange within a few milliseconds, given realistic communication channels with a limited bandwidth. For demonstration we evaluate characteristics of a standard-cell ASIC design realisation as IP-core in 0.18 micrometer-technology.
Category / Keywords: implementation / secret-key cryptography, key management
Publication Info: Full version published in IEEE Transactions on Computers Vol. 54 No. 4, pp. 421-427, April 2005
Date: received 31 Aug 2004, last revised 14 Feb 2005
Contact author: markus volkmer at tuhh de
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Note: Revision after review.
Version: 20050214:122013 (All versions of this report)
Short URL: ia.cr/2004/216
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]