Efficient Algorithms for Pairing-Based Cryptosystems Paulo S. L. M. Barreto1 , Hae Y. Kim1 , Ben Lynn2 , and Michael Scott3 1

First Page		Document Content
Date: 2009-12-03 09:35:00 Finite fields Cryptography Group theory Algebraic number theory Weil pairing XTR Frobenius endomorphism Supersingular elliptic curve Pairing Abstract algebra Algebra Elliptic curves		Efficient Algorithms for Pairing-Based Cryptosystems Paulo S. L. M. Barreto1 , Hae Y. Kim1 , Ben Lynn2 , and Michael Scott3 1 Add to Reading List Source URL: doras.dcu.ie Download Document from Source Website File Size: 229,95 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