Bilinear Pairings in Cryptography Master thesis - Fiction Family - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2009-07-13 10:25:27 Elliptic curve cryptography Pairing-based cryptography Public-key cryptography Group theory Finite fields Tate pairing Hyperelliptic curve Weil pairing BonehLynnShacham BonehFranklin scheme Pairing ID-based encryption		Bilinear Pairings in Cryptography Master thesis #603 by Add to Reading List Source URL: www.math.ru.nl Download Document from Source Website File Size: 399,72 KB Share Document on Facebook

	On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R DocID: 1xVKy - View Document
	A New Family of Pairing-Friendly Elliptic Curves Michael Scott and Aurore Guillevic MIRACL.com Université de Lorraine, CNRS, Inria, LORIA, Nancy, France WAIFI 2018, Bergen, Norway, June 14–16 DocID: 1xVbz - View Document
	Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography Alfred Menezes1 , Palash Sarkar2 , and Shashank Singh3 1 Department of Combinatorics & Optimization, University of Water DocID: 1xTm4 - View Document
	A New Family of Pairing-Friendly elliptic curves Michael Scott1 and Aurore Guillevic2 1 2 DocID: 1xTit - View Document
	PDF Document DocID: 1xPJG - View Document