Michael Scott

	2009
29		Steven D. Galbraith, Xibin Lin, Michael Scott: Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. EUROCRYPT 2009: 518-535
28		Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa: Fast Hashing to G2 on Pairing-Friendly Curves. Pairing 2009: 102-113
27		Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves. Pairing 2009: 78-88
26		Piotr Szczechowiak, Anton Kargl, Michael Scott, Martin Collier: On the application of pairing based cryptography to wireless sensor networks. WISEC 2009: 1-12
	2008
25		Piotr Szczechowiak, Leonardo B. Oliveira, Michael Scott, Martin Collier, Ricardo Dahab: NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks. EWSN 2008: 305-320
24		Ezekiel J. Kachisa, Edward F. Schaefer, Michael Scott: Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field. Pairing 2008: 126-135
23		Steven D. Galbraith, Michael Scott: Exponentiation in Pairing-Friendly Groups Using Homomorphisms. Pairing 2008: 211-224
22		Matthew L. Staten, Steven E. Benzley, Michael Scott: A methodology for quadrilateral finite element mesh coarsening. Eng. Comput. (Lond.) 24(3): 241-251 (2008)
	2007
21		Ali-Reza Adl-Tabatabai, David Dice, Maurice Herlihy, Nir Shavit, Christos Kozyrakis, Christoph von Praun, Michael Scott: Potential show-stoppers for transactional synchronization. PPOPP 2007: 55
20		Augusto Jun Devegili, Michael Scott, Ricardo Dahab: Implementing Cryptographic Pairings over Barreto-Naehrig Curves. Pairing 2007: 197-207
19		Claire Whelan, Michael Scott: The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks. Pairing 2007: 225-246
18		Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O'Eigeartaigh, Michael Scott: Efficient pairing computation on supersingular Abelian varieties. Des. Codes Cryptography 42(3): 239-271 (2007)
17		Robert Ronan, Colm O'Eigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins: Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve. Journal of Systems Architecture 53(2-3): 85-98 (2007)
	2006
16		Michael Scott, Neil Costigan, Wesam Abdulwahab: Implementing Cryptographic Pairings on Smartcards. CHES 2006: 134-147
15		Robert Ronan, Colm O'Eigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins, William P. Marnane: An Embedded Processor for a Pairing-Based Cryptosystem. ITNG 2006: 192-197
14		Colm O'Eigeartaigh, Michael Scott: Pairing Calculation on Supersingular Genus 2 Curves. Selected Areas in Cryptography 2006: 302-316
13		Claire Whelan, Michael Scott: Side Channel Analysis of Practical Pairing Implementations: Which Path Is More Secure? VIETCRYPT 2006: 99-114
12		Michael Scott, Paulo S. L. M. Barreto: Generating More MNT Elliptic Curves. Des. Codes Cryptography 38(2): 209-217 (2006)
	2005
11		Michael Scott: Computing the Tate Pairing. CT-RSA 2005: 293-304
10		Michael Scott, Matthew Earp, Steven E. Benzley, Michael Stephenson: Adaptive Sweeping Techniques. IMR 2005: 417-432
9		Michael Scott: Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism. INDOCRYPT 2005: 258-269
8		Anu Bhargava, Michael Scott, Ryan Traylor, Roy Chung, Kimberly Mrozek, Jonathan Wolter, Hong Z. Tan: Effect of Cognitive Load on Tactor Location Identification in Zero-g. WHC 2005: 56-62
	2004
7		Michael Scott, Paulo S. L. M. Barreto: Compressed Pairings. CRYPTO 2004: 140-156
6		Paulo S. L. M. Barreto, Ben Lynn, Michael Scott: Efficient Implementation of Pairing-Based Cryptosystems. J. Cryptology 17(4): 321-334 (2004)
5		Michael Scott: Cryptanalysis of an ID-based password authentication scheme using smart cards and fingerprints. Operating Systems Review 38(2): 73-75 (2004)
	2003
4		Paulo S. L. M. Barreto, Ben Lynn, Michael Scott: On the Selection of Pairing-Friendly Groups. Selected Areas in Cryptography 2003: 17-25
	2002
3		Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott: Efficient Algorithms for Pairing-Based Cryptosystems. CRYPTO 2002: 354-368
2		Paulo S. L. M. Barreto, Ben Lynn, Michael Scott: Constructing Elliptic Curves with Prescribed Embedding Degrees. SCN 2002: 257-267
	1996
1		Paul Davern, Michael Scott: Fractal Based Image Steganography. Information Hiding 1996: 279-294

Coauthor Index

1	Wesam Abdulwahab	[16]
2	Ali-Reza Adl-Tabatabai	[21]
3	Paulo S. L. M. Barreto	[2] [3] [4] [6] [7] [12] [18]
4	Naomi Benger	[27] [28]
5	Steven E. Benzley	[10] [22]
6	Anu Bhargava	[8]
7	Manuel Charlemagne	[27] [28]
8	Roy Chung	[8]
9	Martin Collier	[25] [26]
10	Neil Costigan	[16]
11	Ricardo Dahab	[20] [25]
12	Paul Davern	[1]
13	Augusto Jun Devegili	[20]
14	David Dice	[21]
15	Matthew Earp	[10]
16	Steven D. Galbraith	[18] [23] [29]
17	Maurice Herlihy	[21]
18	Ezekiel J. Kachisa	[24] [27] [28]
19	Anton Kargl	[26]
20	Tim Kerins	[15] [17]
21	Hae Yong Kim	[3]
22	Christoforos E. Kozyrakis (Christos Kozyrakis)	[21]
23	Xibin Lin	[29]
24	Ben Lynn	[2] [3] [4] [6]
25	William P. Marnane (Liam Marnane)	[15]
26	Kimberly Mrozek	[8]
27	Colin C. Murphy	[15] [17]
28	Colm O'Eigeartaigh	[14] [15] [17] [18]
29	Leonardo B. Oliveira	[25]
30	Luis J. Dominguez Perez	[27] [28]
31	Christoph von Praun	[21]
32	Robert Ronan	[15] [17]
33	Edward F. Schaefer	[24]
34	Nir Shavit	[21]
35	Matthew L. Staten	[22]
36	Michael Stephenson	[10]
37	Piotr Szczechowiak	[25] [26]
38	Hong Z. Tan	[8]
39	Ryan Traylor	[8]
40	Claire Whelan	[13] [19]
41	Jonathan Wolter	[8]

Colors in the list of coauthors