Michael Scott

Michael Scott: Client-Server Authentication Using Pairings. IACR Cryptology ePrint Archive 2012: 148 (2012)

Michael Scott: Cryptanalysis of a recent two factor authentication scheme. IACR Cryptology ePrint Archive 2012: 527 (2012)

Leonardo B. Oliveira, Diego F. Aranha, Conrado Porto Lopes Gouvêa, Michael Scott, Danilo F. Câmara, Julio López, Ricardo Dahab: TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks. Computer Communications 34(3): 485-493 (2011)

Steven D. Galbraith, Xibin Lin, Michael Scott: Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. J. Cryptology 24(3): 446-469 (2011)

Michael Scott: On the Efficient Implementation of Pairing-Based Protocols. IMA Int. Conf. 2011: 296-308

Nick Parlante, Julie Zelenski, Keith Schwarz, Dave Feinberg, Michelle Craig, Stuart Hansen, Michael Scott, David J. Malan: Nifty assignments. SIGCSE 2011: 491-492

Michael Scott: On the Efficient Implementation of Pairing-Based Protocols. IACR Cryptology ePrint Archive 2011: 334 (2011)

Piotr Szczechowiak, Michael Scott, Martin Collier: Securing wireless sensor networks: an identity-based cryptography approach. IJSNet 8(3/4): 182-192 (2010)

David Freeman, Michael Scott, Edlyn Teske: A Taxonomy of Pairing-Friendly Elliptic Curves. J. Cryptology 23(2): 224-280 (2010)

Benoît Chevallier-Mames, Jean-Sébastien Coron, Noel McCullagh, David Naccache, Michael Scott: Secure Delegation of Elliptic-Curve Pairing. CARDIS 2010: 24-35

Luis J. Dominguez Perez, Michael Scott: Designing a Code Generator for Pairing Based Cryptographic Functions. Pairing 2010: 207-224

Robert Granger, Michael Scott: Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions. Public Key Cryptography 2010: 209-223

Naomi Benger, Michael Scott: Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography. WAIFI 2010: 180-195

Steven D. Galbraith, Xibin Lin, Michael Scott: Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. EUROCRYPT 2009: 518-535

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

Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa: Fast Hashing to G₂ on Pairing-Friendly Curves. Pairing 2009: 102-113

Piotr Szczechowiak, Anton Kargl, Michael Scott, Martin Collier: On the application of pairing based cryptography to wireless sensor networks. WISEC 2009: 1-12

Luis J. Dominguez Perez, Ezekiel J. Kachisa, Michael Scott: Implementing cryptographic pairings: a magma tutorial. IACR Cryptology ePrint Archive 2009: 72 (2009)

Naomi Benger, Michael Scott: Constructing Tower Extensions for the implementation of Pairing-Based Cryptography. IACR Cryptology ePrint Archive 2009: 556 (2009)

Robert Granger, Michael Scott: Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions. IACR Cryptology ePrint Archive 2009: 565 (2009)

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

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

Steven D. Galbraith, Michael Scott: Exponentiation in Pairing-Friendly Groups Using Homomorphisms. Pairing 2008: 211-224

Steven D. Galbraith, Michael Scott: Exponentiation in pairing-friendly groups using homomorphisms. IACR Cryptology ePrint Archive 2008: 117 (2008)

Steven D. Galbraith, Xibin Lin, Michael Scott: Endomorphisms for faster elliptic curve cryptography on a large class of curves. IACR Cryptology ePrint Archive 2008: 194 (2008)

Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa: On the final exponentiation for calculating pairings on ordinary elliptic curves. IACR Cryptology ePrint Archive 2008: 490 (2008)

Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa: Fast hashing to G2 on pairing friendly curves. IACR Cryptology ePrint Archive 2008: 530 (2008)

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)

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)

Augusto Jun Devegili, Michael Scott, Ricardo Dahab: Implementing Cryptographic Pairings over Barreto-Naehrig Curves. Pairing 2007: 197-207

Claire Whelan, Michael Scott: The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks. Pairing 2007: 225-246

Neil Costigan, Michael Scott: Accelerating SSL using the Vector processors in IBM's Cell Broadband Engine for Sony's Playstation 3. IACR Cryptology ePrint Archive 2007: 61 (2007)

Michael Scott: Optimal Irreducible Polynomials for GF(2^m) Arithmetic. IACR Cryptology ePrint Archive 2007: 192 (2007)

Michael Scott, Piotr Szczechowiak: Optimizing Multiprecision Multiplication for Public Key Cryptography. IACR Cryptology ePrint Archive 2007: 299 (2007)

Augusto Jun Devegili, Michael Scott, Ricardo Dahab: Implementing Cryptographic Pairings over Barreto-Naehrig Curves. IACR Cryptology ePrint Archive 2007: 390 (2007)

Ezekiel J. Kachisa, Edward F. Schaefer, Michael Scott: Constructing Brezing-Weng pairing friendly elliptic curves using elements in the cyclotomic field. IACR Cryptology ePrint Archive 2007: 452 (2007)

Leonardo B. Oliveira, Michael Scott, Julio López, Ricardo Dahab: TinyPBC: Pairings for Authenticated Identity-Based Non-Interactive Key Distribution in Sensor Networks. IACR Cryptology ePrint Archive 2007: 482 (2007)

Michael Scott, Paulo S. L. M. Barreto: Generating More MNT Elliptic Curves. Des. Codes Cryptography 38(2): 209-217 (2006)

Michael Scott, Neil Costigan, Wesam Abdulwahab: Implementing Cryptographic Pairings on Smartcards. CHES 2006: 134-147

Robert Ronan, Colm O'Eigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins: FPGA acceleration of the tate pairing in characteristic 2. FPT 2006: 213-220

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

Colm O'Eigeartaigh, Michael Scott: Pairing Calculation on Supersingular Genus 2 Curves. Selected Areas in Cryptography 2006: 302-316

Claire Whelan, Michael Scott: Side Channel Analysis of Practical Pairing Implementations: Which Path Is More Secure? VIETCRYPT 2006: 99-114

Colm O'Eigeartaigh, Michael Scott: Pairing Calculation on Supersingular Genus 2 Curves. IACR Cryptology ePrint Archive 2006: 5 (2006)

Michael Scott, Neil Costigan, Wesam Abdulwahab: Implementing Cryptographic Pairings on Smartcards. IACR Cryptology ePrint Archive 2006: 144 (2006)

David Freeman, Michael Scott, Edlyn Teske: A taxonomy of pairing-friendly elliptic curves. IACR Cryptology ePrint Archive 2006: 372 (2006)

Augusto Jun Devegili, Colm O'Eigeartaigh, Michael Scott, Ricardo Dahab: Multiplication and Squaring on Pairing-Friendly Fields. IACR Cryptology ePrint Archive 2006: 471 (2006)

Michael Scott: Computing the Tate Pairing. CT-RSA 2005: 293-304

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

Michael Scott: Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism. INDOCRYPT 2005: 258-269

Michael Scott: Scaling security in pairing-based protocols. IACR Cryptology ePrint Archive 2005: 139 (2005)

Benoît Chevallier-Mames, Jean-Sébastien Coron, Noel McCullagh, David Naccache, Michael Scott: Secure Delegation of Elliptic-Curve Pairing. IACR Cryptology ePrint Archive 2005: 150 (2005)

Michael Scott: Faster Pairings using an Elliptic Curve with an Efficient Endomorphism. IACR Cryptology ePrint Archive 2005: 252 (2005)

Robert Ronan, Colm O. hEigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins, William P. Marnane: A Dedicated Processor for the eta Pairing. IACR Cryptology ePrint Archive 2005: 330 (2005)

Michael Scott, Paulo S. L. M. Barreto: On a (Flawed) Proposal to Build More Pairing-Friendly Curves. IACR Cryptology ePrint Archive 2005: 362 (2005)

Paulo S. L. M. Barreto, Ben Lynn, Michael Scott: Efficient Implementation of Pairing-Based Cryptosystems. J. Cryptology 17(4): 321-334 (2004)

Michael Scott: Cryptanalysis of an ID-based password authentication scheme using smart cards and fingerprints. Operating Systems Review 38(2): 73-75 (2004)

Michael Scott, Paulo S. L. M. Barreto: Compressed Pairings. CRYPTO 2004: 140-156

Michael Scott, Paulo S. L. M. Barreto: Compressed Pairings. IACR Cryptology ePrint Archive 2004: 32 (2004)

Michael Scott, Paulo S. L. M. Barreto: Generating more MNT elliptic curves. IACR Cryptology ePrint Archive 2004: 58 (2004)

Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O. hEigeartaigh, Michael Scott: Efficient Pairing Computation on Supersingular Abelian Varieties. IACR Cryptology ePrint Archive 2004: 375 (2004)

Paulo S. L. M. Barreto, Ben Lynn, Michael Scott: On the Selection of Pairing-Friendly Groups. Selected Areas in Cryptography 2003: 17-25

Nicolas T. Courtois, Robert T. Johnson, Pascal Junod, Thomas Pornin, Michael Scott: Did Filiol Break AES ? IACR Cryptology ePrint Archive 2003: 22 (2003)

Paulo S. L. M. Barreto, Ben Lynn, Michael Scott: On the Selection of Pairing-Friendly Groups. IACR Cryptology ePrint Archive 2003: 86 (2003)

Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott: Efficient Algorithms for Pairing-Based Cryptosystems. CRYPTO 2002: 354-368

Paulo S. L. M. Barreto, Ben Lynn, Michael Scott: Constructing Elliptic Curves with Prescribed Embedding Degrees. SCN 2002: 257-267

Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott: Efficient Algorithms for Pairing-Based Cryptosystems. IACR Cryptology ePrint Archive 2002: 8 (2002)

Paulo S. L. M. Barreto, Ben Lynn, Michael Scott: Constructing Elliptic Curves with Prescribed Embedding Degrees. IACR Cryptology ePrint Archive 2002: 88 (2002)

Paul Davern, Michael Scott: Fractal Based Image Steganography. Information Hiding 1996: 279-294