Faster ECC over F2521 −1 Robert Granger 1 and Michael Scott 2 1 Laboratory for Cryptologic Algorithms School of Computer and Communication Sciences EPFL, Switzerland - Mersenne prime - Document - PDFSEARCH.IO

First Page	Meta Content
	Faster ECC over F2521 −1 Robert Granger 1 and Michael Scott 2 1 Laboratory for Cryptologic Algorithms School of Computer and Communication Sciences EPFL, Switzerland Add to Reading List Document Date: 2015-03-30 09:25:34 Open Document File Size: 270,97 KB Share Result on Facebook Company CertiVox Labs / Michael Scott 2 1 Laboratory / / / IndustryTerm faster protocols / web request / / Organization Cryptologic Algorithms School of Computer / Electronic Frontier Foundation / / SocialTag Group theory Algebraic number theory Modular arithmetic Prime number Repunit Multiplication Mersenne prime Integer Abstract algebra Mathematics

Faster ECC over F2521 −1 Robert Granger 1 and Michael Scott 2 1 Laboratory for Cryptologic Algorithms School of Computer and Communication Sciences EPFL, SwitzerlandAdd to Reading List