<?xml version="1.0" encoding="utf-8"?>
<!-- RSS generated by STEPHEN COPE on Wed, 16 May 2012 22:03:26 GMT -->
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>Department of Statistics Seminars</title>
    <link>http://www.stat.auckland.ac.nz/seminar/</link>
    <description>Upcoming Seminars to be held at the Department of Statistics, The University of Auckland</description>
    <language>en-nz</language>
    <item><title>Linear regression modulo p, learning with errors, and applications to cryptography</title><link>http://www.stat.auckland.ac.nz/2012/seminar/#at-2012-05-24</link><description>Thursday, 24 May 2012, 4:00 pm; Assoc. Prof. Steven Galbraith, U. Auckland; Abstract: Public key cryptography is a very active research area, with many theoretical and practical challenges.
One area of current theoretical interest is &quot;lattice-based cryptography&quot;. Many of the computational problems in this area have a rather statistical flavour.  In particular, I will discuss the learning with errors problem (LWE), which can be thought of as linear regression modulo a prime. LWE was introduced by Oded Regev in 2005 and has a number of cryptographic applications.  The talk will be a survey of some of this work and will be accessible to a general audience. 
</description>
<dc:creator>Mark Holmes</dc:creator><dc:date>2012-05-04</dc:date></item>
  </channel>
</rss>

