• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for matematiske fag
  • View Item
  •   Home
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for matematiske fag
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Cryptographic Protocols from Lattice Assumptions

Berge, Guro Rio.
Bachelor thesis
Thumbnail
View/Open
no.ntnu:inspera:103848036:47713694.pdf (6.859Mb)
URI
https://hdl.handle.net/11250/3009054
Date
2022
Metadata
Show full item record
Collections
  • Institutt for matematiske fag [2243]
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.
 
Publisher
NTNU

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit