Finsler Encryption

Inspired by previous work with the first example proposed at SecITC 2020, we give a general description of Finsler encryption that is based on a Finsler space, which uses a kind of a differentiable geometry on a smooth manifold, with appropriate quantization as the security parameter. Key generation, encryption and decryption algorithms are introduced in detail, and a further example is presented. Then we analyse security properties of Finsler encryption. First, as the dimension (as another security parameter) increases, the length of the secret key also increases, and hence the computational hardness becomes stronger. Second, we prove indistinguishability against chosen-plaintext attacks.