Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Lightweight message authentication for constrained devices
KTH, Skolan för elektroteknik och datavetenskap (EECS), Elektronik, Elektronik och inbyggda system.ORCID-id: 0000-0001-7382-9408
KTH.
KTH.
2018 (engelsk)Inngår i: WiSec 2018 - Proceedings of the 11th ACM Conference on Security and Privacy in Wireless and Mobile Networks, Association for Computing Machinery (ACM), 2018, s. 196-201Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Message Authentication Codes (MACs) used in today's wireless communication standards may not be able to satisfy resource limitations of simpler 5G radio types and use cases such as machine type communications. As a possible solution, we present a lightweight message authentication scheme based on the cyclic redundancy check (CRC). It has been previously shown that a CRC with an irreducible generator polynomial as the key is an -almost XOR-universal (AXU) hash function with = (m + n)/2n-1, where m is the message size and n is the CRC size. While the computation of n-bit CRCs can be efficiently implemented in hardware using linear feedback shift registers, generating random degree-n irreducible polynomials is computationally expensive for large n. We propose using a product of k irreducible polynomials whose degrees sum up to n as a generator polynomial for an n-bit CRC and show that the resulting hash functions are -AXU with = (m + n)k/2n -k. The presented message authentication scheme can be seen as providing a trade-off between security and implementation efficiency.

sted, utgiver, år, opplag, sider
Association for Computing Machinery (ACM), 2018. s. 196-201
Emneord [en]
CRC, Data integrity, Message authentication, Universal hashing
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-238189DOI: 10.1145/3212480.3212482ISI: 000456097500020Scopus ID: 2-s2.0-85050922730ISBN: 9781450357319 (tryckt)OAI: oai:DiVA.org:kth-238189DiVA, id: diva2:1264486
Konferanse
11th ACM Conference on Security and Privacy in Wireless and Mobile Networks, WiSec 2018, 18 June 2018 through 20 June 2018
Merknad

QC 20181120

Tilgjengelig fra: 2018-11-20 Laget: 2018-11-20 Sist oppdatert: 2019-02-12bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Søk i DiVA

Av forfatter/redaktør
Dubrova, ElenaNäslund, MatsLindqvist, Fredrik
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 351 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf