Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 5 - Supersingular isogeny graphs in cryptography

  • Edited by Allan Lo, University of Birmingham, Richard Mycroft, University of Birmingham, Guillem Perarnau, Universitat Politècnica de Catalunya, Barcelona, Andrew Treglown, University of Birmingham
  • Book:
    Surveys in Combinatorics 2019
    Published online:
    17 June 2019
    Print publication:
    27 June 2019, pp 143-166

  • Summary

    We describe recent applications of expander graphs in cryptography, particularly supersingular isogeny graphs. The security of these cryptographic constructions relies on the assumption that computing paths in these graphs is practically infeasible, even with a quantum computer. One of these cryptographic constructions is currently considered for standardization by NIST. We also recall a related construction based on Lubotzky-Philips-Sarnak's celebrated Ramanujan graphs. We describe an efficient path-finding algorithm for these graphs which was motivated by the cryptographic application, and we mention connections to the problem of optimal quantum circuit synthesis.