Paper 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.
Note: Revision after review.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Implementation
- Publication info
- Published elsewhere. Full version published in IEEE Transactions on Computers Vol. 54 No. 4, pp. 421-427, April 2005
- Keywords
- secret-key cryptographykey management
- Contact author(s)
- markus volkmer @ tuhh de
- History
- 2005-02-14: last of 2 revisions
- 2004-09-01: received
- See all versions
- Short URL
- https://ia.cr/2004/216
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2004/216,
author = {Markus Volkmer and Sebastian Wallner},
title = {Tree Parity Machine Rekeying Architectures},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/216},
year = {2004},
url = {https://eprint.iacr.org/2004/216}
}
