First Page | Document Content | |
---|---|---|
Date: 2010-07-03 02:36:48Group theory Cryptography Decisional Diffie–Hellman assumption Pairing G1 Subgroup XDH assumption Algebra Computational hardness assumptions Mathematics | Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman Stanford University, USA Eurocrypt 2010Add to Reading ListSource URL: theory.stanford.eduDownload Document from Source WebsiteFile Size: 408,43 KBShare Document on Facebook |