PERIDOT Codes: Replacing Identifiers, Sequence Numbers and Nonces with Permutations

TL;DR

PERIDOT codes introduce a permutation-based scheme that replaces traditional identifiers and sequence numbers in low-power networks, reducing energy consumption and nonce reuse frequency.

Contribution

This paper presents the novel PERIDOT coding scheme that uses integer permutations to identify transmitters, improving efficiency and security in low-power wide-area networks.

Findings

PERIDOT significantly reduces power consumption.

It increases intervals between nonce reuses.

Provides bounds and methods for permutation construction.

Abstract

Identifiers and sequence numbers make up a large part of the protocol overhead in certain low-power wide-area networks. The requirement for cryptographic nonces in authentication and encryption schemes often demands excessively long sequence numbers, which leads to an increase in energy consumption per transmitted packet. In this paper, the novel PERIDOT coding scheme is proposed. It replaces identifiers and sequence numbers with a code, based on which receivers can identify transmitters with high confidence. PERIDOT is based on specially constructed integer permutations assigned to transmitters. An upper bound on the performance of PERIDOT codes is provided and methods for constructing particularly suitable permutations are presented. In practice, PERIDOT can significantly increase intervals between nonce reuses and, at the same time, reduce power consumption.