A low-cost solution for frequent symmetric key exchange in ad-hoc networks
dc.contributor.author | Volkmer, Markus | |
dc.contributor.author | Wallner, Sebastian | |
dc.contributor.editor | Dadam, Peter | |
dc.contributor.editor | Reichert, Manfred | |
dc.date.accessioned | 2019-10-11T11:42:11Z | |
dc.date.available | 2019-10-11T11:42:11Z | |
dc.date.issued | 2004 | |
dc.description.abstract | Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complexity) solution for feasible frequent symmetric key exchange in adhoc networks, based on a Tree Parity Machine Rekeying Architecture. A key exchange can be performed within a few milliseconds, given practical wireless communication channels and their limited bandwidths. A flexible rekeying functionality enables the full exploitation of the achievable key exchange rates. Characteristics of a standardcell ASIC design realisation as IP-core in 0.18µ-technology are evaluated. | en |
dc.identifier.isbn | 3-88579-379-2 | |
dc.identifier.pissn | 1617-5468 | |
dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/28831 | |
dc.language.iso | en | |
dc.publisher | Gesellschaft für Informatik e.V. | |
dc.relation.ispartof | Informatik 2004 – Informatik verbindet – Band 1, Beiträge der 34. Jahrestagung der Gesellschaft für Informatik e.V. (GI) | |
dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-50 | |
dc.title | A low-cost solution for frequent symmetric key exchange in ad-hoc networks | en |
dc.type | Text/Conference Paper | |
gi.citation.endPage | 132 | |
gi.citation.publisherPlace | Bonn | |
gi.citation.startPage | 128 | |
gi.conference.date | 20.-24. September 2004 | |
gi.conference.location | Ulm | |
gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1
Lade...
- Name:
- GI-Proceedings.50-23.pdf
- Größe:
- 287.07 KB
- Format:
- Adobe Portable Document Format