Paper 2005/235 Original: eprint.iacr.org/2005/235 ↗

Tree Parity Machine Rekeying Architectures for Embedded Security

Markus Volkmer
Sebastian Wallner
Abstract

Nonclassical cryptographic technologies are considered in science and industry to provide alternative security solutions. They are motivated by the strong restrictions as they are often present in embedded security scenarios and in applications of pervasive computing. We investigate a low hardware-complexity cryptosystem for lightweight symmetric key exchange, based on two new Tree Parity Machine Rekeying Architectures (TPMRAs). The speed of a key exchange is basically only limited by the channel capacity. This work significantly improves and extends previously published results on TPMRAs. We evaluate characteristics of standard-cell ASIC design realizations as IP-core in 0.18-micrometer-CMOS technology.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint.
History
2005-07-20: last updated
2005-07-20: published
Short URL
https://ia.cr/2005/235
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2005/235,
      author = {Markus Volkmer and Sebastian Wallner},
      title = {Tree Parity Machine Rekeying Architectures for Embedded Security},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/235},
      year = {2005},
      url = {https://eprint.iacr.org/2005/235}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.