Cryptographic Protocols from Lattice Assumptions

Abstract

Bachelor oppgåva vil introdusera to gitter-problem, learning with errors (LWE) and shortest integer solution (SIS), som sikkerheten til gitter-kryptografi baserer seg på. LWE og SIS var introdusert av henholdsvis Oded Regev i 2005 og Ajtai Miklos i 1996. Vidare vil bacheloren gi eit innblikk i korleis ein kan bruka gitter-problema i kryptering, forpliktelse-protokoll, kunnskapsløyse bevis, og digitale signaturer.

This thesis will introduce two of the lattice-problems, learning with errors (LWE) and shortest integer solution (SIS), which the security of lattice cryptography rely on. These problems were introduced by Oded Regev in 2005 and Ajtai Miklos in 1996, respectively. Further, the thesis will provide insight into how one can use them in encryption and commitment schemes, zero-knowledge protocols (ZKP), and digital signatures.