Cryptographic hash Functions from Expander Graphs

First Page		Document Content
Date: 2012-06-20 09:47:28 Analytic number theory Group theory Supersingular elliptic curve Graph Finite fields Supersingular K3 surface Homomorphic signatures for network coding Abstract algebra Mathematics Elliptic curves		Cryptographic hash Functions from Expander Graphs Add to Reading List Source URL: csrc.nist.gov Download Document from Source Website File Size: 516,09 KB Share Document on Facebook

	Homomorphic Signatures for Verifiable Computing Advisor(s): Christian Hanser Institute for Applied Information Processing and Communications (IAIK) Graz University of Technology, Austria DocID: 1pAot - View Document
	Exercises on pairings on elliptic curves Andreas Enge Leuven, Friday, 13 September 2013 Exercise 1 (Weil reciprocity). Let E : Y 2 = X 3 + X over F7 , f = Y , g = X−1 X−3 . Compute div f and div g, and verify that f DocID: 1menO - View Document
	Verified Indifferentiable Hashing into Elliptic Curves Santiago Zanella B´eguelin1 Gilles Barthe2 , Benjamin Gr´egoire3 , Sylvain Heraud3 and Federico Olmedo2 DocID: 19OIw - View Document
	1 On the Security and Efficiency of Content Distribution Via Network Coding Qiming Li∗ John C.S. Lui+ DocID: 19zI1 - View Document
	Formally Certifying the Security of Digital Signature Schemes Santiago Zanella B´eguelin Benjamin Gr´egoire INRIA Sophia Antipolis - M´editerran´ee Microsoft Research - INRIA Joint Centre {Santiago.Zanella,Benjamin.G DocID: 19n6t - View Document