Michael Scott

Mike Scott

Retired from DCU 1st March 2012

Grouping: 
Academic Lecturing
Office: 
L1.22
Phone Number: 
+353-1-7005537
Email Address: 

Research Group: 
Dependable Systems
Associated Research Centres: 
None
Research Interests: 

Cryptography

Selected Publications: 

For My Citations, click on

http://scholar.google.com/citations?user=GsM-aeEAAAAJ

2011

Scott M. "On Efficient Implementation of Pairing-Based Protocols", IMACC 2011, December 2011, Oxford, England, LNCS 7089, pp. 296-308, Springer-Verlag 2011

Galbraith S.D., Lin X., Scott M. "Endomorphisms for Faster Elliptic Curve Cryptography on a large Class of Curves", Journal of Cryptography, Volume 24, Number 3, July 2011, pp446-469

Oliveira L., Aranha, D., Gouvea C., Scott M., Camara D., Lopez J. and Dahab R. “TinyPBC: Pairings for Authenticated Identity-Based non-interactive Key Distribution in Sensor Networks”, Computer Communications, Volume 34, Issue 3, March 2011, pp485-493

2010

Benger N. and Scott M. “Constructing Tower Extensions of Finite Fields for Implementation of pairing-Based Cryptography”, WAIFI 2010, Istanbul, Turkey, LNCS 6087, pp. 180-195, Springer-Verlag 2010

Granger R., and Scott M. “Faster Squaring in the Cyclotomic Subgroup of sixth degree extensions”, PKC 2010, Paris, France, LNCS 6056, pp. 209-223, Springer-Verlag 2010

Freeman D., Scott M. and Teske E. “A Taxonomy of Pairing-Friendly Elliptic Curves”, Journal of Cryptography, Vol. 23, pp. 224-280, Springer-Verlag 2010

Chevallier-Mames B., Coron J-S., McCullagh N., Naccache D. and Scott M. “Secure Delegation of Elliptic Curve Pairing”, CARDIS 2010, Passau, Germany, LNCS 6035, pp 24-35, Springer-Verlag 2010

2009

Galbraith S., Lin X., and Scott M. “Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves”, Eurocrypt 2009, Cologne, Germany, LNCS 5479, pp. 518-535, Springer-Verlag 2009

Hankerson D., Menezes A. and Scott M. “Software Implementation of Pairings”, Chapter 12 in Identity Based Cryptography, Ed. Joye & Neven, pp.188-206, IOS Press 2009

Whelan C., Page D.,Vercauteren F., Scott M. and Marnane W. “Implementation Attacks and Countermeasures”, Chapter 14 in Identity Based Cryptography, Ed. Joye & Neven, pp.226-244, IOS Press 2009

Scott M., Benger N., Charlemagne M., Dominquez Perez L. and Kachisa E. “On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves”, Pairing 2009, Palo Alto, USA, LNCS 5671, pp. 78-88, Springer-Verlag 2009

Scott M., Benger N., Charlemagne M., Dominquez Perez L. and Kachisa E. “Fast Hashing to G2 on Pairing Friendly Curves”, Pairing 2009, LNCS 5671, pp. 102-113, Springer-Verlag 2009

Szczechowiak P., Kargl A., Scott M. and Collier M. “On the application of Pairing based Cryptography to Wireless Sensor Networks”, Proc. 2nd ACM  Conference on Wireless Network Security, WiSec 09, Zurich, Switzerland, pp.1-12, ACM 2009 

2008

Galbraith S. and Scott M. “Exponentiation in Pairing-Friendly groups using Homomorphisms”, Pairing 2008, London, England, LNCS 5209, pp. 211-224, Springer-Verlag 2008

Kachisa E., Schaefer E. and Scott M. “Constructing Brezing-Weng Pairing-Friendly Elliptic Curves using Elements in the Cyclotomic Field”, Pairing 2008, London, England, LNCS 5209, pp. 126-135, Springer-Verlag 2008

Szczechowiak P., Oliveira L., Scott M., Collier M. and Dahab R. “NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor networks”, EWSN 2008, Bologne, Italy,  LNCS 4913, pp. 305-320, Springer-Verlag 2008

2007

Whelan C. and Scott M. “On the importance of the Final Exponentiation in Pairings when considering Fault Attacks”, Pairing 2007, Tokyo, Japan,  LNCS 4575, pp. 225-246, Springer-Verlag 2007

Scott M.“Implementing Cryptographic Pairings”, Pairing 2007, Tokyo, Japan, LNCS 4575, pp. 177-196, Springer-Verlag 2007

Devegili A., Scott M. and Dahab R. “Implementing Cryptographic Pairings over Barreto-Naehrig Curves”, Pairing 2007, Tokyo, Japan, LNCS 4575, pp. 197-207, Springer-Verlag 2007

Barreto P., Galbraith S., OhEigeartaigh C. and Scott M. “Efficient Pairing Computation on Supersingular Abelian Varieties”, Designs, Codes and Cryptography, Vol. 42, pp. 239-271, Springer-Verlag 2007

OhEigeartaigh C. andScott M. “Pairing Calculation on Supersingular Genus 2 Curves”, SAC 2007, Ottawa, Canada, LNCS 4356, pp. 302-316, Springer-Verlag 2007

Ronan R., OhEigeartaigh C., Murphy C., Scott M. and Kerins T. “Hardware Acceleration of the Tate Pairing on a genus 2 hyperelliptic curve”, Journal of Systems Architecture, Vol. 53, pp. 85-98, Elsevier B.V.

2006

Ronan R., OhEigeartaigh C., Murphy C., Scott M., Kerins T. and Marnane W. “An embedded processor for a Pairing based Cryptosystem”, Proc. 3rd Int. Conference on Information Technology: New Generations, pp192-197, IEEE 2006

Scott M.and Barreto P. “Generating more MNT Elliptic Curves”, Designs, Codes and Cryptography, Vol. 38, pp. 209-217, Springer-Verlag, 2006

Scott M., Costigan N. and Abdulwahab W. “Implementing Cryptographic Pairings on Smartcards”, CHES 2006, Yokohama, Japan, LNCS 4249, pp. 134-147, Springer-Verlag 2006

Whelan C. and Scott M. “Side Channel Analysis of Practical Pairing Implementations: which path is more secure?”, VietCrypt 2006, Hanoi, Vietnam, LNCS 4341, pp. 99-114, Springer-Verlag 2006

2005

Scott M.“Computing the Tate Pairing”, CT-RSA 2005, San Francisco, USA, LNCS 3376, pp. 293-304, Springer-Verlag 2005

Scott M. “Faster Pairings using an Elliptic Curve with an Efficient Endomorphism”, IndoCrypt 2005, Bangalore, India, LNCS 3797, pp. 258-269, Springer-Verlag 2005

2004

Barreto P., Lynn B. and Scott M. “Efficient Implementation of Paring-Based Cryptosystems”, Journal of Cryptography, Vol. 17, pp. 321-334, Springer-Verlag 2004

Scott M. “Faster Identity-Based Encryption”, Electronic Letters, Vol. 40, pp. 861-862, IEE 2204

Scott M.“Cryptanalysis of an ID-based password authentication scheme using smart-cards and fingerprints”, ACM SIGOPS Operating Systems Review, Vol.38, pp. 73-75, ACM 2004

Scott M.“Compressed Pairings”, Crypto 2004, Santa Barbara, USA, LNCS 3152, pp. 73-82, Springer-Verlag 2004

Barreto P., Lynn B. and Scott M. “On the Selection of Pairing-Friendly Groups”, SAC 2004, Waterloo, Canada, LNCS 3006, pp. 17-25, Springer-Verlag 2004

2003

Barreto P., Lynn B. and Scott M. “Constructing Elliptic Curves with Prescribed Embedding Degrees”, SCN 2003, Amalfi, Italy, LNCS 2576, pp. 257-267, Springer-Verlag 2003

2002

Barreto P., Kim H., Lynn B. and Scott M. “Efficient Algorithms for Pairing-based Cryptosystems”, Crypto 2002, Santa Barbara, USA, LNCS 2442, pp. 354-369, Springer-Verlag 2002

 

Active Research Grants: 

SFI funded Claude Shannon Institute for Coding, Cryptography and Information Security