Computing

Prof Mike Scott

Name:Prof Mike Scott
Phone Number5537
Room:L1.22
E-Mail Address:
Work Area:Head of School
HomepagePersonal Homepage

Prof Mike Scott

Prof Mike Scott

Selected Peer Reviewed Journals

  • Freeman D., Scott M. and Teske E. 2010. A Taxonomy of Pairing-Friendly Elliptic Curves. Journal Of Cryptology, 23, , pp224-280.
  • Barreto P., Galbraith S., O'hEigeartaigh C. and Scott M. 2007. Efficient pairing computation on supersingular Abelian varieties. Designs Codes And Cryptography, 42, , pp239-271.
  • Ronan R., O'hEigeartaigh C., Murphy C., Scott M. and Kerins T. 2007. Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve. Journal Of Systems Architecture (the Euromicro Journal), 53, 2-3, pp85-98.
  • Scott M. and Barreto P. S. L. M.. 2006. Generating more MNT elliptic curves. Designs Codes And Cryptography, 38, 2, pp209-217.
  • Barreto P. S. L. M., Lynn B., and Scott M. 2004. Efficient implementation of pairing-based cryptosystems. Journal Of Cryptology, 17, 4, pp321-334.
  • Scott M. 2004. Faster Identity Based Encryption. Electronics Letters, 40, 14, pp861-861.
  • Scott M. 1998. On an ID based Key Exchange Scheme. Electronics Letters, 34, 7
  • Scott M. 1989. Fast Rounding in Multiprecision Floating-Slash Arithmetic. Ieee Transactions On Computers, 38, 7, pp1049-1052.
  • Scott M. 1986. Time/Fuel Optimal Control of Constrained Linear Discrete Systems. Automatica, 22, 6, pp711-715.

Selected Chapters

Selected Non-peer Reviewed Journals

  • Scott M. 2004. Cryptanalysis of an ID-based Password Authentication Scheme using Smart Cards and Fingerprints. ACM Operating Systems Review, 38, pp73-75.
  • Scott M. 2002. Authenticated ID-based Key Exchange and remote log-in with insecure token and PIN number. Cryptology ePrint Archive, Report 2002/164, http://eprint.iacr.org/2002/164,
  • Scott M. 1988. MIRACL - A Multiprecision Library. The C Users Journal, 6, pp76-80.
  • Scott M., Computing the Tate Pairing, In: Lecture Notes in Computer Science 3376, Springer-Verlag, 2005. ed.Cryptography track - RSA-2005, - , San Francisco, USA, 293 - 304
  • Davern P. Scott M., The Application of Fractal Image Compression to Steganography, In: Lecture Notes in Computer Science, Springer-Verlag, 1996 ed.1st Information Hiding Workshop, - , University of Cambridge, UK
  • Scott M., Time-Optimal Control of State Constrained Linear Discrete Systems, In: Springer-Verlag 1978 ed.Proceedings 8th IFIP Conference on Optimization Techniques, - , Wurzburg, Germany
  • Scott M., Faster pairings using an elliptic curve with an efficient endomorphism, In: Lecture Notes in Computer Science Vol. 3797, Springer-Verlag 2005. ed.INDOCRYPT 2005, - , Bangalore, India, 258 - 269
  • Barreto P.S.L.M.,Lynn B.,Scott M., Constructing Elliptic Curves with Prescribed Embedding Degrees, In: Lecture Notes in Computer Science 2576, Springer-Verlag (2003). See also Cryptology ePrint Archive, Report 2002/088. ed.Proceedings of the Third Workshop on Security in Communication Networks (SCN'2002), - , Amalfi, Italy
  • Scott M., and Barreto P.S.L.M., Compressed Pairings, In: Lecture Notes in Computer Science 3152, Springer-Verlag, 2004. See also Cryptology ePrint Archive, Report 2004/032 ed.Advances in Cryptology - Crypto'200, - , Santa Barbara, California, 140 - 156
  • Barreto P.S.L.M., Lynn B., Scott M., On the Selection of Pairing-Friendly Groups, In: Lecture Notes in Computer Science 3006, Springer-Verlag (2004). See also Cryptology ePrint Archive, Report 2003/086 ed.Selected Areas in Cryptography (SAC'2003), - , Ottawa, Canada, 17 - 25
  • Barreto P.S.L.M.,Kim, H.Y, Lynn, B., Scott M., Efficient Algorithms for Pairing-Based Cryptosystems, In: Lecture Notes in Computer Science 2442, Springer-Verlag (2002). See also Cryptology ePrint Archive, Report 2002/008. ed.Advances in Cryptology - Crypto'2002, - , Santa Barbara, California, 354 - 368
  • Benger N. and Scott M., Constructing Tower Extensions of Finite Fields for Implementation of pairing-Based Cryptography, WAIFI 2010, 27-JUN-10 - 30-JUN-10, Istanbul, Turkey, 180 - 195
  • Granger R., and Scott M., Faster Squaring in the Cyclotomic Subgroup of sixth degree extensions, PKC 2010, 26-MAY-10 - 28-MAY-10, Paris, France, 209 - 223
  • Chevallier-Mames B., Coron J-S., McCullagh N., Naccache D. and Scott M., Secure Delegation of Elliptic Curve Pairing, CARDIS 2010, 14-APR-10 - 16-APR-10, Passau, Germany, 24 - 35
  • Scott M., Benger N., Charlemagne M., Dominquez Perez L. and Kachisa E., Fast Hashing to G2 on Pairing Friendly Curves, Pairing 2009, 12-AUG-09 - 14-AUG-09, Stanford USA, 102 - 113
  • 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, 12-AUG-09 - 14-AUG-09, Stanford, USA, 78 - 88
  • Galbraith S., Lin X., and Scott M., Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves, Eurocrypt 2009, 26-APR-09 - 03-APR-09, Cologne, Germany, 518 - 535
  • Szczechowiak P., Kargl A., Scott M. and Collier M., On the application of Pairing based Cryptography to Wireless Sensor Networks, WiSec 09, 16-MAR-09 - 18-MAR-09, Zurich, Switzerland, 1 - 12
  • Galbraith S. and Scott M., Exponentiation in Pairing-Friendly groups using Homomorphisms, Pairing 2008, 01-SEP-08 - 03-SEP-08, London, 211 - 224
  • Kachisa E., Schaefer E. and Scott M., Constructing Brezing-Weng Pairing-Friendly Elliptic Curves using Elements in the Cyclotomic Field, Pairing 2008, 01-SEP-08 - 03-SEP-08, London, 126 - 135
  • Szczechowiak P., Oliveira L., Scott M., Collier M. and Dahab R., NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor networks, EWSN 2008, 30-JAN-08 - 01-FEB-08, Bologne, Italy, 305 - 320
  • OhEigeartaigh C. and Scott M., Pairing Calculation on Supersingular Genus 2 Curves, SAC 2007, 16-AUG-07 - 17-AUG-07, Ottawa, Canada, 302 - 316
  • Whelan C., and Scott M., "The Importance of the Final Exponentiation in Pairings when considering Fault attacks", In: Lecture Notes in Computer Science, Vol. 4575, Springer, 2007 ed.Pairing-Based Cryptography - Pairing 2007, 02-JUL-07 - 04-JUL-07, Tokyo Japan, 225 - 246
  • Devegili A.J., and Scott M., Implementing Cryptographic Pairings over Barreto-Naehrig curves, In: Lecture Notes in Computer Science, Vol. 4575, Springer, 2007 ed.Pairing-Based Cryptography - Pairing 2007, 02-JUL-07 - 04-JUL-07, Tokyo Japan, 197 - 207
  • Scott M., Implementing Cryptographic Pairings, In: Lecture Notes in Computer Science, Vol. 4575, Springer, 2007 ed.Pairing-Based Cryptography, 02-JUL-07 - 04-JUL-07, Tokyo, Japan, 177 - 196
  • Costigan N., and Scott M., Accelerating SSL using the Vector processors in IBM's Cell Broadband Engine for Sony's Playstation 3, SPEED, 11-JUN-07 - 12-JUN-07, Amsterdam
  • Scott M., Optimal Irreducible Polynomials for GF(2^m) Arithmetic, SPEED, 11-JUN-07 - 12-JUN-07, Amsterdam
  • Scott M., Costigan N., and Abdulwahab, W, Implementing Cryptographic Pairings on Smartcards, In: Lecture Notes in Computer Science, Vol. 4249 Springer-Verlag ed.CHES 2006, 10-OCT-06 - 13-OCT-06, Yokohama, Japan, 134 - 147
  • Whelan C. and Scott M., Side channel Analysis of Practical Pairing Implementations: Which Path is More Secure?, In: Lecture Notes in Computer Science, Volume 4341 Springer-Verlag ed.VietCrypt 2006, 25-SEP-06 - 28-SEP-06, Hanoi, Vietnam, 99 - 114
  • Scott M., Implementing Cryptographic Pairings, ECC 2006, 18-SEP-06 - 20-SEP-06, Toronto, Canada
  • O'hEigeartaigh C. and Scott M., Pairing Calculation on Supersingular Genus 2 Curves, In: Lecture Notes in Computer Science, Vol. 4356 Springer-Verlag ed.Selected Areas in Cryptography, 17-APR-06 - 18-APR-06, Montreal, Quebec, Canada, 303 - 318
  • Ronan R., O'hEigeartaigh C. Kerins T., Marnane W.P., Scott M., Murphy C., An Embedded Processor for a Pairing-Based Cryptosystem, In: IEEE Computer Society ISBN:0-7695-2497-4 ed.Third International Conference on Information Technology : New Generations, 10-APR-06 - 12-APR-06, Las Vegas, Nevada USA, 192 - 197