<html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
  </head>
  <body>
    <p>-------- Forwarded Message --------</p>
    <div class="moz-forward-container">
      <table class="moz-email-headers-table" cellspacing="0" cellpadding="0" border="0">
        <tbody>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">Subject:
            </th>
            <td>[DMANET] Crypto Postdoc @ Durham</td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
            <td>Mon, 18 Oct 2021 10:46:52 +0100</td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
            <td>Pooya Farshim <a class="moz-txt-link-rfc2396E" href="mailto:pooya.farshim@gmail.com">&lt;pooya.farshim@gmail.com&gt;</a></td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">To: </th>
            <td><a class="moz-txt-link-abbreviated" href="mailto:dmanet@zpr.uni-koeln.de">dmanet@zpr.uni-koeln.de</a></td>
          </tr>
        </tbody>
      </table>
      <br>
      <br>
      The Department of Computer Science at Durham University is looking
      for a<br>
      postdoctoral researcher from 1 Jan 2022 to work on an EPSRC
      project on<br>
      topics related to password-hashing algorithms and idealized models
      of<br>
      computation for a period of two years.<br>
      <br>
      We would be interested in applicants holding (or nearing the
      completion of)<br>
      a PhD in Cryptography, Algorithms and Complexity, or Mathematics
      who have<br>
      strong interests in the foundational aspects of crypto, proof
      techniques,<br>
      and definitional work. For those with backgrounds Complexity/Math,
      the<br>
      position would be a good opportunity for transitioning into
      Cryptography.<br>
      <br>
      Durham is one of the top (and oldest) universities in the UK, and
      the CS<br>
      department hosts one of the strongest Theory groups across the
      ACiD and<br>
      NESTiD groups:<br>
      <br>
      <a class="moz-txt-link-freetext" href="https://algorithmscomplexity.webspace.durham.ac.uk/">https://algorithmscomplexity.webspace.durham.ac.uk/</a>&gt;<br>
      <a class="moz-txt-link-freetext" href="https://nestid.webspace.durham.ac.uk/">https://nestid.webspace.durham.ac.uk/</a>&gt;<br>
      For informal queries about the position please contact Pooya
      Farshim:<br>
      <a class="moz-txt-link-abbreviated" href="mailto:pooya.farshim@gmail.com">pooya.farshim@gmail.com</a> .<br>
      <br>
      <br>
    </div>
  </body>
</html>