Michael Scott |
|
|---|---|
Author's Web Page  | |
| 12 papers in database with 1436 citations  H-number: 11 | |
Journal Papers |
|
| 1. Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O'Eigeartaigh, Michael Scott, Efficient pairing computation on supersingular Abelian varieties, Designs, Codes and Cryptography,
Volume 42(3), pp. 239 - 271,
Springer, 2007. [  Electronic
Edition][ Cited
170 times
 ] | |
| 2. Michael Scott, Paulo S. L. M. Barreto, Generating More MNT Elliptic Curves, Designs, Codes and Cryptography,
Volume 38(2), pp. 209 - 217,
Springer, 2006. [ Electronic
Edition][Cited
45 times
] | |
| 3. Paulo S. L. M. Barreto, Ben Lynn, Michael Scott, Efficient Implementation of Pairing-Based Cryptosystems, Journal of Cryptology,
Volume 17(4), pp. 321 - 334,
Springer, 2004. [ Cited
59 times
] | |
Conference Papers |
|
| 1. Steven D. Galbraith, Xibin Lin, Michael Scott, Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves, pp. 518 - 535, EUROCRYPT 2009. [ Electronic
Edition][Cited
14 times
] | |
| 2. Claire Whelan, Michael Scott, Side Channel Analysis of Practical Pairing Implementations: Which Path Is More Secure?, pp. 99 - 114, VIETCRYPT 2006. [ Electronic
Edition][Cited
16 times
] | |
| 3. Colm O'Eigeartaigh, Michael Scott, Pairing Calculation on Supersingular Genus 2 Curves, pp. 302 - 316, SAC 2006. [ Electronic
Edition][Cited
11 times
] | |
| 4. Michael Scott, Neil Costigan, Wesam Abdulwahab, Implementing Cryptographic Pairings on Smartcards, pp. 134 - 147, CHES 2006. [ Electronic
Edition][Cited
57 times
] | |
| 5. Michael Scott, Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism, pp. 258 - 269, INDOCRYPT 2005. [ Electronic
Edition][Cited
28 times
] | |
| 6. Michael Scott, Computing the Tate Pairing, pp. 293 - 304, CT-RSA 2005. [ Electronic
Edition][Cited
97 times
] | |
| 7. Michael Scott, Paulo S. L. M. Barreto, Compressed Pairings, pp. 140 - 156, CRYPTO 2004. [ Electronic
Edition][ IACR Online
Archive ][Cited
93 times
] | |
| 8. Paulo S. L. M. Barreto, Ben Lynn, Michael Scott, On the Selection of Pairing-Friendly Groups, pp. 17 - 25, SAC 2003. [ Electronic
Edition][Cited
121 times
] | |
| 9. Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott, Efficient Algorithms for Pairing-Based Cryptosystems, pp. 354 - 368, CRYPTO 2002. [ Electronic
Edition][IACR Online
Archive][Cited
725 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals