| Document Date: 2009-12-03 09:35:00
Open Document File Size: 229,95 KBShare Result on Facebook
City Dublin / Pairing / / Country United States / Brazil / Ireland / / Currency pence / / / Facility Stanford University / Square Root Extraction One / / IndustryTerm certain cryptographic applications / faster algorithms / triple-and-add scalar multiplication algorithm / scalar multiplication algorithm / conventional algorithm / abelian group law / faster scalar multiplication algorithm / faster point addition algorithm / basic algorithm / / Organization School of Computer Applications Dublin City University Ballymun / Stanford University / Computer Science Department / / Person Luciano Gualberto / / Position Prime Minister / signature representative / / Product Franklin / / SportsLeague Stanford University / / Technology cryptography / Av / escrow ElGamal encryption / faster point addition algorithm / Identity-based encryption / triple-and-add scalar multiplication algorithm / noticeably faster scalar multiplication algorithm / scalar multiplication algorithm / conventional algorithm / basic algorithm / Tonelli-Shanks algorithm / /
SocialTag |
Efficient Algorithms for Pairing-Based Cryptosystems Paulo S. L. M. Barreto1 , Hae Y. Kim1 , Ben Lynn2 , and Michael Scott3 1