Fully Homomorphic Encryption via Affine Automorphisms
Paul Hriljac

TL;DR
This paper introduces a novel homomorphic encryption scheme based on affine automorphisms and multivariate encryption, leveraging algebraic geometry to enable secure computation on encrypted data.
Contribution
It presents a new homomorphic encryption approach using affine automorphisms and multivariate encryption, expanding cryptographic techniques with algebraic geometry methods.
Findings
Proposes a homomorphic encryption scheme based on affine automorphisms.
Utilizes multivariate encryption for data security.
Potential applications in cybersecurity for secure data processing.
Abstract
Homomorphic encryption is a method used in cryptopgraphy to create programs that can interact with encrypted data without ever leaving the data in the clear. This has many potential applications in cybersecurity. This paper uses automorphisms of affine space to create a form of homomorphic encryption for straight line programs. The encryption method used for the data is known as multivariate encryption. This gives a potentially powerful new method in cyber security based on techniques from algebraic geometry.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Polynomial and algebraic computation · Complexity and Algorithms in Graphs
