Symmetric Key Encryption for Arbitrary Block Sizes from Affine Spaces

Publication date 22 December 2016

Affine spaces (automorphisms, embeddings, exotic structures, cancellation problem) (14R10)

Abstract: 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.

This page was built for publication: Symmetric Key Encryption for Arbitrary Block Sizes from Affine Spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281155)