Cryptographic hash functions from expander graphs

First Page		Document Content
Date: 2012-06-20 09:42:34 Group theory Ramanujan graph Spectral theory Srinivasa Ramanujan Graph Elliptic curve Modular group Graph theory Mathematics Analytic number theory		Cryptographic hash functions from expander graphs Add to Reading List Source URL: csrc.nist.gov Download Document from Source Website File Size: 92,21 KB Share Document on Facebook

	Orthogonal Polynomials and Spectral Algorithms Nisheeth K. Vishnoi 1.0 d=0 DocID: 1uxDb - View Document
	MODULE AND FILTERED KNOT HOMOLOGY THEORIES JEFF HICKS Abstract. We provide a new way to define Bar-Natan’s F2 [u] knot homology theory. The u torsion of BN •,• is shown to explicitly give Turner’s spectral sequen DocID: 1tmp7 - View Document
	Lecture Notes on Expansion, Sparsest Cut, and Spectral Graph Theory Luca Trevisan University of California, Berkeley DocID: 1t8rW - View Document
	Spectral Graph Theory and its Applications Lecture 10 Expander Codes Lecturer: Daniel A. Spielman DocID: 1sypf - View Document
	Spectral Graph Theory Lecture 15 Properties of Expander Graphs Daniel A. Spielman DocID: 1sweE - View Document