Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
- 30 November 2017
- book chapter
- Published by Springer Nature
- p. 3-33
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Computing the endomorphism ring of an ordinary elliptic curve over a finite fieldJournal of Number Theory, 2011
- Fast Polynomial Factorization and Modular CompositionSIAM Journal on Computing, 2011
- Low-dimensional lattice basis reduction revisitedACM Transactions on Algorithms, 2009
- Cryptographic Hash Functions from Expander GraphsJournal of Cryptology, 2007
- NON-BACKTRACKING RANDOM WALKS MIX FASTERCommunications in Contemporary Mathematics, 2007
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- Computing Frobenius maps and factoring polynomialscomputational complexity, 1992
- Ramanujan graphs and Hecke operatorsBulletin of the American Mathematical Society, 1990
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- Die Typen der Multiplikatorenringe elliptischer FunktionenkörperAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1941