Conference
Lightweight MACs from Universal Hash Functions
| العنوان: | Lightweight MACs from Universal Hash Functions |
|---|---|
| المؤلفون: | Duval, Sébastien, Leurent, Gaëtan |
| المساهمون: | Security, Cryptology and Transmissions (SECRET), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Université Catholique de Louvain = Catholic University of Louvain (UCL), The work of Sébastien Duval has been funded in partsby the European Commission through the H2020 project 731591 (acronym RE-ASSURE) |
| المصدر: | Lecture Notes in Computer Science ; CARDIS 2019 - 18th Smart Card Research and Advanced Application Conference ; https://inria.hal.science/hal-02424904 ; CARDIS 2019 - 18th Smart Card Research and Advanced Application Conference, Nov 2019, Prague, Czech Republic. pp.195-215, ⟨10.1007/978-3-030-42068-0_12⟩ |
| بيانات النشر: | HAL CCSD Springer |
| سنة النشر: | 2019 |
| المجموعة: | Université de Rennes 1: Publications scientifiques (HAL) |
| مصطلحات موضوعية: | Lightweight cryptography, Micro-controller, MAC, Al-most Universal hash functions, Beyond-birthday-bound security, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] |
| جغرافية الموضوع: | Prague, Czech Republic |
| الوصف: | International audience ; Lightweight cryptography is a topic of growing importance, with the goal to secure the communication of low-end devices that are not powerful enough to use conventional cryptography. There have been many recent proposals of lightweight block ciphers, but comparatively few results on lightweight Message Authentication Codes (MACs). Therefore, this paper focuses on lightweight MACs. We review some existing constructions, and revisit the choices made in mainstream MACs with a focus on lightweight cryptography. We consider MACs based on universal hash functions, because they offer information theoretic security , can be implemented efficiently and are widely used in conventional cryptography. However, many constructions used in practice (such as GMAC or Poly1305-AES) follow the Wegman-Carter-Shoup construction , which is only secure up to 2 64 queries with a 128-bit state. We point out that there are simple solutions to reach security beyond the birthday bound, and we propose a concrete instantiation, MAC611, reaching 61-bit security with a 61-bit universal hash function. We wrote an optimized implementation on two ARM micro-controllers, and we obtain very good performances on the Cortex-M4, at only 3.7 c/B for long messages, and less than one thousand cycles for short messages. |
| نوع الوثيقة: | conference object |
| اللغة: | English |
| DOI: | 10.1007/978-3-030-42068-0_12 |
| الاتاحة: | https://inria.hal.science/hal-02424904 https://inria.hal.science/hal-02424904v1/document https://inria.hal.science/hal-02424904v1/file/MAC_CA19.pdf https://doi.org/10.1007/978-3-030-42068-0_12 |
| Rights: | http://creativecommons.org/licenses/by/ ; info:eu-repo/semantics/OpenAccess |
| رقم الانضمام: | edsbas.EB0308FD |
| قاعدة البيانات: | BASE |
| DOI: | 10.1007/978-3-030-42068-0_12 |
|---|