Enumeration of Boolean Mapping with Given Cryptographic Properties for Personal Data Protection in Blockchain Data Storage

Abstract

Currently, blockchain data storage systems are considered promising for storing important information, including personal data. However, the requirements of modern legislation in various countries pose challenges to such systems, including the need to delete data at the request of users, which contradicts the very concept of the blockchain. One way to solve this problem is to use encryption. The paper presents the most powerful asymptotic estimates of the cardinality of sets of correlation-immune and (n,m,k)-resilient Boolean mappings that are used in the construction of stream encryption systems. Also, a recurrence relation is proved, allowing to calculate the number of (n,m,k)-resilient mappings for small values n, m and k.