Subject: [Cfrg] bMAC - Permutation as MAC key

From: Pascal Urien <[email-masked]>
Date: Tue, 31 Dec 2019 09:56:13 +0100

Hi All

The bijective MAC Time Stamped (bMAC_TS algorithm see
https://tools.ietf.org/html/draft-urien-core-bmac-05) aims at detecting
malicious (corrupted) softwarein embedded systems.

It works with two pillars, memory space is finite, and computing time is
stable.

Memory space is hashed according to a pseudo random order. The computing
time is measured in order to defeat code decompression procedures.

I have written a test software for arduino nano (33KB space memory for
FLASH + SRAM+EEPROM)

Computing time is about 27s (# 1m/byte), roughly speaking the computing
time follows a normal distribution, the entropy is about 10bits (3 standard
deviation)

The code is here: https://github.com/purien/bMAC

Comments welcome ..