{"id":170495,"date":"2010-07-03T12:03:35","date_gmt":"2010-07-03T12:03:35","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/project\/lattice-based-cryptography\/"},"modified":"2018-11-08T15:25:21","modified_gmt":"2018-11-08T23:25:21","slug":"lattice-based-cryptography","status":"publish","type":"msr-project","link":"https:\/\/www.microsoft.com\/en-us\/research\/project\/lattice-based-cryptography\/","title":{"rendered":"Lattice-based Cryptography"},"content":{"rendered":"<p><img loading=\"lazy\" decoding=\"async\" class=\"alignleft\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/lattice-based-cryptography-2.png\" width=\"142\" height=\"100\" \/>Lattices are geometric objects that have recently emerged as a powerful tool in cryptography. Lattice-based schemes have also proven to be remarkably resistant to sub-exponential and quantum attacks (in sharp contrast to their number-theoretic friends).<\/p>\n<p>Our goal is to use lattices to construct cryptographic primitives that are simultaneously highly efficient and highly functional.<\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/lattice-tf2011latticebasedcrypto.pptx\" target=\"_self\">Our Techfest Poster on Lattice-based Cryptography<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Lattices are geometric objects that have recently emerged as a powerful tool in cryptography. Lattice-based schemes have also proven to be remarkably resistant to sub-exponential and quantum attacks (in sharp contrast to their number-theoretic friends). Our goal is to use lattices to construct cryptographic primitives that are simultaneously highly efficient and highly functional. Our Techfest [&hellip;]<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"footnotes":""},"research-area":[13561,243138,13558],"msr-locale":[268875],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-170495","msr-project","type-msr-project","status-publish","hentry","msr-research-area-algorithms","msr-research-area-quantum","msr-research-area-security-privacy-cryptography","msr-locale-en_us","msr-archive-status-active"],"msr_project_start":"2010-07-03","related-publications":[161286,167580],"related-downloads":[234785],"related-videos":[],"related-groups":[],"related-events":[],"related-opportunities":[],"related-posts":[],"related-articles":[],"tab-content":[],"slides":[],"related-researchers":[],"msr_research_lab":[199565],"msr_impact_theme":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-project\/170495"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-project"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-project"}],"version-history":[{"count":3,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-project\/170495\/revisions"}],"predecessor-version":[{"id":549387,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-project\/170495\/revisions\/549387"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=170495"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=170495"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=170495"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=170495"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=170495"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}