Symmetric Key Encryption for Arbitrary Block Sizes from Affine Spaces
This addresses encryption needs for non-standard block sizes, but appears incremental as it adapts existing mathematical concepts to a specific domain.
The paper tackles the problem of symmetric key encryption for arbitrary block sizes by representing numbers as points in affine spaces over finite fields and using algebro-geometric transformations for encryption, achieving over 2^5478 keys for a block size under 2^128.
A symmetric key encryption scheme is described for blocks of general size N that is a product of powers of many prime numbers. This is accomplished by realising each number (representing a message unit) as a point in a product of affine spaces over various finite fields. Then algebro-geometric transformations on those affine spaces is transported back to provide encryption. For a specific block size${}<2^{128}$ we get more than $2^{5478}$ keys.