Supersingular isogeny graphs in cryptography

DOI10.1017/9781108649094.006zbMATH Open1476.94028OpenAlexW3092838249MaRDI QIDQ5149170FDOQ5149170

Authors: Kristin Lauter, Christophe Petit 

Publication date: 6 February 2021

Published in: Surveys in Combinatorics 2019 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/9781108649094.006

Recommendations

• Ramanujan graphs in cryptography
• Adventures in Supersingularland
• Ramanujan graphs for post-quantum cryptography
• Computational problems in supersingular elliptic curve isogenies
• The supersingular isogeny problem in genus 2 and beyond

zbMATH Keywords

cryptographydigital signatureshash functionskey exchangesupersingular isogeny graphs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Expander graphs (05C48)

Cited In (10)

• Ramanujan graphs in cryptography
• Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography
• On isogeny graphs of supersingular elliptic curves over finite fields
• Explicit connections between supersingular isogeny graphs and Bruhat-Tits trees
• Orienting supersingular isogeny graphs
• Verifiable delay functions from supersingular isogenies and pairings
• On the Security of Supersingular Isogeny Cryptosystems
• Ramanujan graphs for post-quantum cryptography
• Adventures in Supersingularland
• Expander graphs based on GRH with an application to elliptic curve cryptography

This page was built for publication: Supersingular isogeny graphs in cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149170)