Public-Key Encryption from the Lattice Isomorphism Problem
Résumé
We introduce the first public-key encryption scheme relying on the Lattice Isomorphism Problem. We generalize a restricted-to-$\mathbb{Z}^n$ scheme from Benett et al. using the quadratic form formalism. Our proposal benefits from more versatility, no floating points arithmetics, and relies on a plausibly falsifiable assumption.
Domaines
Cryptographie et sécurité [cs.CR]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|