DOPE: MDC-2 Scheme Using PRESENT

DOI

10.2991/acsr.k.220202.040How to use a DOI?

Keywords

Hash function; Lightweight block cipher; PRESENT; MDC-2; Yuval’s birthday attack

Abstract

Modification Detection Code (MDC) as an unkeyed hash function is designed to provide data integrity. Manipulation Detection Codes (MDC-2) is one of double-length (2n-bit) hash-values that requires 2 block cipher operations per block of hash input where the output size of the hash function is twice the size of the block cipher. Constructing hash function from block ciphers as in MDC-2 is expected to produce a hashing algorithm that has the same efficiency and properties that are following its use as a block cipher. In this paper, we construct a Double-length Matyas-Meyer-Oseas based on PRESENT (DOPE) hash algorithm, that implements PRESENT as a lightweight block cipher on the MDC-2 scheme. PRESENT is used as the primary compression function with 64-bit block message and 80-bit key as the inputs. To analyze the performance and resistance of DOPE against collision, a test is conducted using Yuval’s Birthday Attack. It generates minor modification input of 2³² on extreme input pairs with uniform values and input pairs with random values, and it is proven to be collision-resistant.

Copyright

© 2022 The Authors. Published by Atlantis Press International B.V.

Open Access

This is an open access article under the CC BY-NC license.

Download article (PDF)

TY  - CONF
AU  - Anjeli Lutfiani
AU  - Bety Hayat Susanti
PY  - 2022
DA  - 2022/02/08
TI  - DOPE: MDC-2 Scheme Using PRESENT
BT  - Proceedings of the  International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021)
PB  - Atlantis Press
SP  - 215
EP  - 221
SN  - 2352-538X
UR  - https://doi.org/10.2991/acsr.k.220202.040
DO  - 10.2991/acsr.k.220202.040
ID  - Lutfiani2022
ER  -